/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/loop-acceleration/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 21:21:20,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 21:21:20,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 21:21:20,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 21:21:20,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 21:21:20,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 21:21:20,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 21:21:20,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 21:21:20,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 21:21:20,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 21:21:20,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 21:21:20,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 21:21:20,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 21:21:20,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 21:21:20,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 21:21:20,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 21:21:20,111 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 21:21:20,112 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 21:21:20,114 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 21:21:20,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 21:21:20,120 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 21:21:20,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 21:21:20,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 21:21:20,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 21:21:20,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 21:21:20,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 21:21:20,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 21:21:20,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 21:21:20,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 21:21:20,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 21:21:20,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 21:21:20,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 21:21:20,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 21:21:20,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 21:21:20,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 21:21:20,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 21:21:20,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 21:21:20,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 21:21:20,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 21:21:20,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 21:21:20,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 21:21:20,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 21:21:20,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-27 21:21:20,153 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 21:21:20,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 21:21:20,154 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 21:21:20,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 21:21:20,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 21:21:20,155 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 21:21:20,155 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 21:21:20,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 21:21:20,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 21:21:20,156 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 21:21:20,156 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:21:20,157 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-27 21:21:20,157 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-27 21:21:20,158 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 21:21:20,158 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-27 21:21:20,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 21:21:20,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 21:21:20,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 21:21:20,346 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 21:21:20,346 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 21:21:20,347 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-27 21:21:20,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810741fdd/fcf0d2bcb8ba43b7b6267a49f43846af/FLAG7ba6a1973 [2022-04-27 21:21:20,767 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 21:21:20,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-27 21:21:20,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810741fdd/fcf0d2bcb8ba43b7b6267a49f43846af/FLAG7ba6a1973 [2022-04-27 21:21:20,782 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/810741fdd/fcf0d2bcb8ba43b7b6267a49f43846af [2022-04-27 21:21:20,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 21:21:20,785 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 21:21:20,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 21:21:20,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 21:21:20,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 21:21:20,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e07dfa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20, skipping insertion in model container [2022-04-27 21:21:20,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 21:21:20,800 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 21:21:20,913 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c[322,335] [2022-04-27 21:21:20,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:21:20,930 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 21:21:20,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c[322,335] [2022-04-27 21:21:20,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 21:21:20,955 INFO L208 MainTranslator]: Completed translation [2022-04-27 21:21:20,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20 WrapperNode [2022-04-27 21:21:20,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 21:21:20,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 21:21:20,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 21:21:20,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 21:21:20,971 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,978 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,980 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,981 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 21:21:20,982 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 21:21:20,982 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 21:21:20,982 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 21:21:20,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (1/1) ... [2022-04-27 21:21:20,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 21:21:20,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:21:21,013 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 21:21:21,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 21:21:21,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 21:21:21,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 21:21:21,043 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 21:21:21,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 21:21:21,043 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 21:21:21,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 21:21:21,083 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 21:21:21,084 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 21:21:21,192 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 21:21:21,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 21:21:21,196 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 21:21:21,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:21:21 BoogieIcfgContainer [2022-04-27 21:21:21,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 21:21:21,198 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 21:21:21,198 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 21:21:21,199 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 21:21:21,201 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:21:21" (1/1) ... [2022-04-27 21:21:21,202 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-27 21:21:21,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:21:21 BasicIcfg [2022-04-27 21:21:21,212 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 21:21:21,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 21:21:21,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 21:21:21,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 21:21:21,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 09:21:20" (1/4) ... [2022-04-27 21:21:21,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1795647e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:21:21, skipping insertion in model container [2022-04-27 21:21:21,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 09:21:20" (2/4) ... [2022-04-27 21:21:21,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1795647e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 09:21:21, skipping insertion in model container [2022-04-27 21:21:21,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 09:21:21" (3/4) ... [2022-04-27 21:21:21,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1795647e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:21:21, skipping insertion in model container [2022-04-27 21:21:21,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 09:21:21" (4/4) ... [2022-04-27 21:21:21,217 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-1.cqvasr [2022-04-27 21:21:21,225 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 21:21:21,225 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 21:21:21,274 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 21:21:21,293 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1436e450, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d31ba39 [2022-04-27 21:21:21,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 21:21:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 21:21:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:21:21,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:21,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:21,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:21,313 INFO L85 PathProgramCache]: Analyzing trace with hash -756157467, now seen corresponding path program 1 times [2022-04-27 21:21:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:21,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596504209] [2022-04-27 21:21:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {22#true} is VALID [2022-04-27 21:21:21,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:21:21,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:21:21,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:21,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {22#true} is VALID [2022-04-27 21:21:21,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:21:21,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:21:21,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22#true} is VALID [2022-04-27 21:21:21,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {22#true} is VALID [2022-04-27 21:21:21,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} [51] L16-2-->L15-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:21:21,418 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {23#false} is VALID [2022-04-27 21:21:21,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} [58] __VERIFIER_assertENTRY-->L6: 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] {23#false} is VALID [2022-04-27 21:21:21,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} [59] L6-->L7: 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[] {23#false} is VALID [2022-04-27 21:21:21,419 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#false} is VALID [2022-04-27 21:21:21,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:21,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:21,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596504209] [2022-04-27 21:21:21,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596504209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:21:21,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:21:21,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 21:21:21,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339227497] [2022-04-27 21:21:21,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:21:21,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 21:21:21,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:21,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:21,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 21:21:21,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:21,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 21:21:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:21:21,454 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:21,498 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-27 21:21:21,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 21:21:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-27 21:21:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:21:21,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 21:21:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-27 21:21:21,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-27 21:21:21,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:21,546 INFO L225 Difference]: With dead ends: 30 [2022-04-27 21:21:21,546 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 21:21:21,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 21:21:21,550 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:21:21,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:21:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 21:21:21,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 21:21:21,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:21:21,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,568 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,568 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:21,570 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 21:21:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 21:21:21,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:21,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:21,571 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 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 13 states. [2022-04-27 21:21:21,571 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 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 13 states. [2022-04-27 21:21:21,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:21,573 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-27 21:21:21,573 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 21:21:21,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:21,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:21,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:21:21,573 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:21:21,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-27 21:21:21,575 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-27 21:21:21,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:21:21,576 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-27 21:21:21,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-27 21:21:21,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 21:21:21,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:21,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:21,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 21:21:21,577 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:21,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:21,578 INFO L85 PathProgramCache]: Analyzing trace with hash -755233946, now seen corresponding path program 1 times [2022-04-27 21:21:21,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:21,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307453185] [2022-04-27 21:21:21,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:21,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,668 INFO L290 TraceCheckUtils]: 0: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {115#true} is VALID [2022-04-27 21:21:21,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {115#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:21:21,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {115#true} {115#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:21:21,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {115#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:21,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {115#true} is VALID [2022-04-27 21:21:21,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {115#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:21:21,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {115#true} {115#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:21:21,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {115#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {115#true} is VALID [2022-04-27 21:21:21,673 INFO L290 TraceCheckUtils]: 5: Hoare triple {115#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {120#(= main_~x~0 0)} is VALID [2022-04-27 21:21:21,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {120#(= main_~x~0 0)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-27 21:21:21,675 INFO L272 TraceCheckUtils]: 7: Hoare triple {116#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {116#false} is VALID [2022-04-27 21:21:21,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#false} [58] __VERIFIER_assertENTRY-->L6: 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] {116#false} is VALID [2022-04-27 21:21:21,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {116#false} [59] L6-->L7: 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[] {116#false} is VALID [2022-04-27 21:21:21,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {116#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {116#false} is VALID [2022-04-27 21:21:21,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:21,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:21,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307453185] [2022-04-27 21:21:21,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307453185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 21:21:21,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 21:21:21,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 21:21:21,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445133923] [2022-04-27 21:21:21,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 21:21:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 21:21:21,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:21,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:21,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 21:21:21,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:21,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 21:21:21,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 21:21:21,700 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:21,768 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-27 21:21:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 21:21:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-27 21:21:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:21:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 21:21:21,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 21:21:21,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 21:21:21,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:21,792 INFO L225 Difference]: With dead ends: 22 [2022-04-27 21:21:21,792 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 21:21:21,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 21:21:21,793 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:21:21,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:21:21,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 21:21:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 21:21:21,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:21:21,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,796 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,796 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:21,797 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:21:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:21:21,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:21,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:21,798 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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) Second operand 15 states. [2022-04-27 21:21:21,798 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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) Second operand 15 states. [2022-04-27 21:21:21,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:21,799 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-27 21:21:21,799 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:21:21,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:21,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:21,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:21:21,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:21:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 21:21:21,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-27 21:21:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:21:21,800 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 21:21:21,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 21:21:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 21:21:21,801 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:21,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:21,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 21:21:21,802 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:21,802 INFO L85 PathProgramCache]: Analyzing trace with hash 980092676, now seen corresponding path program 1 times [2022-04-27 21:21:21,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:21,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132611681] [2022-04-27 21:21:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:21,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:21,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,865 INFO L290 TraceCheckUtils]: 0: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {212#true} is VALID [2022-04-27 21:21:21,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:21,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {219#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {212#true} is VALID [2022-04-27 21:21:21,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:21:21,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:21:21,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {218#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:21:21,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {218#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:21:21,869 INFO L272 TraceCheckUtils]: 9: Hoare triple {213#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {213#false} is VALID [2022-04-27 21:21:21,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} [58] __VERIFIER_assertENTRY-->L6: 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] {213#false} is VALID [2022-04-27 21:21:21,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#false} [59] L6-->L7: 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[] {213#false} is VALID [2022-04-27 21:21:21,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:21:21,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:21,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132611681] [2022-04-27 21:21:21,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132611681] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:21:21,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272923473] [2022-04-27 21:21:21,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:21,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:21:21,879 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:21:21,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 21:21:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 21:21:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:21,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:21:21,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {212#true} is VALID [2022-04-27 21:21:21,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:21,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:21:21,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {217#(= main_~x~0 0)} is VALID [2022-04-27 21:21:22,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {217#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {244#(= main_~x~0 1)} is VALID [2022-04-27 21:21:22,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {244#(= main_~x~0 1)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:21:22,002 INFO L272 TraceCheckUtils]: 9: Hoare triple {213#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {213#false} is VALID [2022-04-27 21:21:22,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} [58] __VERIFIER_assertENTRY-->L6: 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] {213#false} is VALID [2022-04-27 21:21:22,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#false} [59] L6-->L7: 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[] {213#false} is VALID [2022-04-27 21:21:22,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:21:22,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:22,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:21:22,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {213#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:21:22,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {213#false} [59] L6-->L7: 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[] {213#false} is VALID [2022-04-27 21:21:22,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {213#false} [58] __VERIFIER_assertENTRY-->L6: 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] {213#false} is VALID [2022-04-27 21:21:22,081 INFO L272 TraceCheckUtils]: 9: Hoare triple {213#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {213#false} is VALID [2022-04-27 21:21:22,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {272#(< (mod main_~x~0 4294967296) 268435455)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {213#false} is VALID [2022-04-27 21:21:22,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {272#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 21:21:22,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 21:21:22,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {276#(< (mod (+ main_~x~0 1) 4294967296) 268435455)} is VALID [2022-04-27 21:21:22,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:22,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:22,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:22,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {212#true} is VALID [2022-04-27 21:21:22,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {212#true} is VALID [2022-04-27 21:21:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:22,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272923473] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:21:22,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:21:22,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 21:21:22,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842985182] [2022-04-27 21:21:22,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:21:22,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:21:22,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:22,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:22,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 21:21:22,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 21:21:22,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 21:21:22,110 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:22,261 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-27 21:21:22,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 21:21:22,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-27 21:21:22,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:21:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 21:21:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-04-27 21:21:22,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-04-27 21:21:22,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:22,308 INFO L225 Difference]: With dead ends: 26 [2022-04-27 21:21:22,308 INFO L226 Difference]: Without dead ends: 19 [2022-04-27 21:21:22,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:21:22,310 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 21:21:22,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 21:21:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-27 21:21:22,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-27 21:21:22,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:21:22,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,315 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,315 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:22,316 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 21:21:22,316 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:21:22,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:22,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:22,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 21:21:22,317 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-27 21:21:22,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:22,318 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-27 21:21:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-27 21:21:22,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:22,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:22,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:21:22,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:21:22,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-04-27 21:21:22,319 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2022-04-27 21:21:22,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:21:22,320 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-04-27 21:21:22,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-04-27 21:21:22,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 21:21:22,320 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:22,320 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:22,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 21:21:22,540 WARN L477 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-27 21:21:22,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:22,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1575643231, now seen corresponding path program 1 times [2022-04-27 21:21:22,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:22,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963340342] [2022-04-27 21:21:22,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:22,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:22,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-27 21:21:22,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:22,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:22,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:22,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {421#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-27 21:21:22,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:22,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:22,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:22,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:21:22,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:21:22,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:22,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:22,666 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:22,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:22,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {414#false} is VALID [2022-04-27 21:21:22,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {414#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:21:22,667 INFO L272 TraceCheckUtils]: 13: Hoare triple {414#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {414#false} is VALID [2022-04-27 21:21:22,667 INFO L290 TraceCheckUtils]: 14: Hoare triple {414#false} [58] __VERIFIER_assertENTRY-->L6: 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] {414#false} is VALID [2022-04-27 21:21:22,667 INFO L290 TraceCheckUtils]: 15: Hoare triple {414#false} [59] L6-->L7: 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[] {414#false} is VALID [2022-04-27 21:21:22,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:21:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:22,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:22,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963340342] [2022-04-27 21:21:22,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963340342] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:21:22,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707956419] [2022-04-27 21:21:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:22,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:22,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:21:22,680 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:21:22,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 21:21:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:22,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 21:21:22,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:22,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:21:23,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-27 21:21:23,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:21:23,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {418#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {418#(= main_~x~0 0)} is VALID [2022-04-27 21:21:23,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {418#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:23,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:23,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:23,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:23,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {452#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:23,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:23,077 INFO L272 TraceCheckUtils]: 13: Hoare triple {459#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:21:23,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#(<= 1 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L6: 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] {470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:21:23,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {470#(<= 1 __VERIFIER_assert_~cond)} [59] L6-->L7: 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[] {414#false} is VALID [2022-04-27 21:21:23,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:21:23,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:23,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:21:23,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {414#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {414#false} is VALID [2022-04-27 21:21:23,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {470#(<= 1 __VERIFIER_assert_~cond)} [59] L6-->L7: 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[] {414#false} is VALID [2022-04-27 21:21:23,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#(<= 1 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L6: 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] {470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 21:21:23,179 INFO L272 TraceCheckUtils]: 13: Hoare triple {486#(= (mod main_~x~0 2) 0)} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:21:23,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {486#(= (mod main_~x~0 2) 0)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:21:23,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {486#(= (mod main_~x~0 2) 0)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:21:23,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {486#(= (mod main_~x~0 2) 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:21:23,181 INFO L290 TraceCheckUtils]: 9: Hoare triple {499#(= (mod (+ main_~x~0 1) 2) 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:21:23,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#(= (mod (+ main_~x~0 1) 2) 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {499#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-27 21:21:23,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#(= (mod main_~x~0 2) 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {499#(= (mod (+ main_~x~0 1) 2) 0)} is VALID [2022-04-27 21:21:23,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#(= (mod main_~x~0 2) 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:21:23,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {413#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {486#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:21:23,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {413#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {413#true} {413#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {413#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {413#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {413#true} is VALID [2022-04-27 21:21:23,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {413#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {413#true} is VALID [2022-04-27 21:21:23,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 21:21:23,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707956419] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:21:23,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:21:23,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-04-27 21:21:23,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888085648] [2022-04-27 21:21:23,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:21:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:21:23,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:23,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:23,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 21:21:23,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:23,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 21:21:23,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-04-27 21:21:23,207 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:23,455 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 21:21:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 21:21:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 21:21:23,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:21:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-27 21:21:23,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2022-04-27 21:21:23,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 36 transitions. [2022-04-27 21:21:23,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:23,487 INFO L225 Difference]: With dead ends: 34 [2022-04-27 21:21:23,487 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 21:21:23,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-27 21:21:23,488 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:21:23,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 38 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:21:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 21:21:23,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 21:21:23,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:21:23,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,498 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,498 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:23,506 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 21:21:23,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 21:21:23,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:23,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:23,507 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 21:21:23,507 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-27 21:21:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:23,508 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-27 21:21:23,508 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-27 21:21:23,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:23,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:23,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:21:23,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:21:23,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-27 21:21:23,509 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 17 [2022-04-27 21:21:23,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:21:23,509 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-27 21:21:23,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:23,510 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-27 21:21:23,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 21:21:23,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:23,517 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:23,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 21:21:23,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 21:21:23,733 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:23,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:23,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1560917373, now seen corresponding path program 2 times [2022-04-27 21:21:23,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:23,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648789405] [2022-04-27 21:21:23,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:23,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:23,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:23,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {676#true} is VALID [2022-04-27 21:21:23,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:23,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:23,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {676#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:23,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {676#true} is VALID [2022-04-27 21:21:23,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:23,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:23,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {676#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:23,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:21:23,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {681#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:21:23,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {681#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:23,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:23,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:23,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:23,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 21:21:23,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-27 21:21:23,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {677#false} is VALID [2022-04-27 21:21:23,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:21:23,890 INFO L272 TraceCheckUtils]: 15: Hoare triple {677#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {677#false} is VALID [2022-04-27 21:21:23,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#false} [58] __VERIFIER_assertENTRY-->L6: 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] {677#false} is VALID [2022-04-27 21:21:23,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {677#false} [59] L6-->L7: 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[] {677#false} is VALID [2022-04-27 21:21:23,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:21:23,891 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:23,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:23,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648789405] [2022-04-27 21:21:23,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648789405] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:21:23,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132574829] [2022-04-27 21:21:23,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 21:21:23,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:23,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:21:23,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:21:23,916 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-27 21:21:23,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 21:21:23,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:21:23,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 21:21:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:23,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:21:24,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {676#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {676#true} is VALID [2022-04-27 21:21:24,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {676#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:21:24,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {681#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {681#(= main_~x~0 0)} is VALID [2022-04-27 21:21:24,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {681#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:24,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:24,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:24,187 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:24,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:24,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:24,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {722#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {677#false} is VALID [2022-04-27 21:21:24,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:21:24,189 INFO L272 TraceCheckUtils]: 15: Hoare triple {677#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {677#false} is VALID [2022-04-27 21:21:24,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#false} [58] __VERIFIER_assertENTRY-->L6: 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] {677#false} is VALID [2022-04-27 21:21:24,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {677#false} [59] L6-->L7: 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[] {677#false} is VALID [2022-04-27 21:21:24,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:21:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:24,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:21:24,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {677#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:21:24,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {677#false} [59] L6-->L7: 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[] {677#false} is VALID [2022-04-27 21:21:24,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {677#false} [58] __VERIFIER_assertENTRY-->L6: 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] {677#false} is VALID [2022-04-27 21:21:24,350 INFO L272 TraceCheckUtils]: 15: Hoare triple {677#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {677#false} is VALID [2022-04-27 21:21:24,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {677#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {677#false} is VALID [2022-04-27 21:21:24,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {759#(< (mod main_~x~0 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {677#false} is VALID [2022-04-27 21:21:24,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {763#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {759#(< (mod main_~x~0 4294967296) 65520)} is VALID [2022-04-27 21:21:24,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {763#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} is VALID [2022-04-27 21:21:24,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-27 21:21:24,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {767#(or (not (< (mod (+ main_~x~0 1) 4294967296) 268435455)) (< (mod (+ main_~x~0 1) 4294967296) 65520))} is VALID [2022-04-27 21:21:24,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-27 21:21:24,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {774#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-27 21:21:24,357 INFO L290 TraceCheckUtils]: 6: Hoare triple {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-27 21:21:24,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {676#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {781#(or (not (< (mod (+ main_~x~0 3) 4294967296) 268435455)) (< (mod (+ main_~x~0 3) 4294967296) 65520))} is VALID [2022-04-27 21:21:24,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {676#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,358 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,358 INFO L290 TraceCheckUtils]: 2: Hoare triple {676#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {676#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {676#true} is VALID [2022-04-27 21:21:24,358 INFO L272 TraceCheckUtils]: 0: Hoare triple {676#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#true} is VALID [2022-04-27 21:21:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:24,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132574829] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:21:24,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:21:24,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-04-27 21:21:24,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312623839] [2022-04-27 21:21:24,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:21:24,359 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:21:24,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:24,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:24,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 21:21:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:24,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 21:21:24,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-04-27 21:21:24,385 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:24,906 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-27 21:21:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 21:21:24,906 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 21:21:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:21:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-27 21:21:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 43 transitions. [2022-04-27 21:21:24,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 43 transitions. [2022-04-27 21:21:24,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:24,953 INFO L225 Difference]: With dead ends: 42 [2022-04-27 21:21:24,953 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 21:21:24,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=309, Unknown=0, NotChecked=0, Total=462 [2022-04-27 21:21:24,954 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 21:21:24,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 39 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 21:21:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 21:21:24,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-27 21:21:24,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:21:24,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,975 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,975 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:24,976 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 21:21:24,976 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 21:21:24,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:24,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:24,977 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 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 32 states. [2022-04-27 21:21:24,977 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 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 32 states. [2022-04-27 21:21:24,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:24,978 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-27 21:21:24,978 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 21:21:24,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:24,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:24,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:21:24,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:21:24,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-27 21:21:24,979 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 19 [2022-04-27 21:21:24,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:21:24,979 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-27 21:21:24,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:24,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-27 21:21:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 21:21:24,980 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:24,980 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:24,998 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-27 21:21:25,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:25,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:25,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:25,195 INFO L85 PathProgramCache]: Analyzing trace with hash 838082225, now seen corresponding path program 3 times [2022-04-27 21:21:25,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:25,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929192922] [2022-04-27 21:21:25,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:25,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:25,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1000#true} is VALID [2022-04-27 21:21:25,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:25,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {1015#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1000#true} is VALID [2022-04-27 21:21:25,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1005#(= main_~x~0 0)} is VALID [2022-04-27 21:21:25,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {1005#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1005#(= main_~x~0 0)} is VALID [2022-04-27 21:21:25,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {1005#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:25,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:25,395 INFO L290 TraceCheckUtils]: 9: Hoare triple {1006#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:25,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:25,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {1007#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:25,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:25,397 INFO L290 TraceCheckUtils]: 13: Hoare triple {1008#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:25,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:25,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {1009#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:25,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:25,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {1010#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:25,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:25,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {1011#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:25,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:25,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {1012#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:25,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:25,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {1013#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:21:25,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:21:25,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {1014#(and (<= main_~x~0 9) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1001#false} is VALID [2022-04-27 21:21:25,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {1001#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:21:25,403 INFO L272 TraceCheckUtils]: 27: Hoare triple {1001#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1001#false} is VALID [2022-04-27 21:21:25,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#false} [58] __VERIFIER_assertENTRY-->L6: 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] {1001#false} is VALID [2022-04-27 21:21:25,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {1001#false} [59] L6-->L7: 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[] {1001#false} is VALID [2022-04-27 21:21:25,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:21:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929192922] [2022-04-27 21:21:25,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929192922] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:21:25,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434874303] [2022-04-27 21:21:25,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 21:21:25,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:25,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:21:25,409 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-27 21:21:25,425 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-27 21:21:25,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-27 21:21:25,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:21:25,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 21:21:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:25,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:21:25,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1000#true} is VALID [2022-04-27 21:21:25,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,690 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-27 21:21:25,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-27 21:21:25,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {1088#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1095#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-27 21:21:25,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {1095#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:21:25,693 INFO L272 TraceCheckUtils]: 27: Hoare triple {1001#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1001#false} is VALID [2022-04-27 21:21:25,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#false} [58] __VERIFIER_assertENTRY-->L6: 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] {1001#false} is VALID [2022-04-27 21:21:25,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {1001#false} [59] L6-->L7: 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[] {1001#false} is VALID [2022-04-27 21:21:25,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:21:25,694 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-27 21:21:25,694 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:21:25,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {1001#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:21:25,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {1001#false} [59] L6-->L7: 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[] {1001#false} is VALID [2022-04-27 21:21:25,928 INFO L290 TraceCheckUtils]: 28: Hoare triple {1001#false} [58] __VERIFIER_assertENTRY-->L6: 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] {1001#false} is VALID [2022-04-27 21:21:25,928 INFO L272 TraceCheckUtils]: 27: Hoare triple {1001#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1001#false} is VALID [2022-04-27 21:21:25,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {1123#(< (mod main_~x~0 4294967296) 268435455)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1001#false} is VALID [2022-04-27 21:21:25,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1123#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 21:21:25,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1127#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {1000#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {1000#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {1000#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {1000#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1000#true} {1000#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {1000#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {1000#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1000#true} is VALID [2022-04-27 21:21:25,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {1000#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1000#true} is VALID [2022-04-27 21:21:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 27 proven. 1 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-04-27 21:21:25,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434874303] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:21:25,933 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:21:25,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 4, 4] total 17 [2022-04-27 21:21:25,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160923515] [2022-04-27 21:21:25,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:21:25,934 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 21:21:25,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:25,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:25,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:25,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-27 21:21:25,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:25,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-27 21:21:25,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-27 21:21:25,966 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:26,615 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-04-27 21:21:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-27 21:21:26,615 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-27 21:21:26,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:21:26,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-27 21:21:26,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 60 transitions. [2022-04-27 21:21:26,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 60 transitions. [2022-04-27 21:21:26,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:26,678 INFO L225 Difference]: With dead ends: 63 [2022-04-27 21:21:26,678 INFO L226 Difference]: Without dead ends: 53 [2022-04-27 21:21:26,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=249, Invalid=743, Unknown=0, NotChecked=0, Total=992 [2022-04-27 21:21:26,679 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 21:21:26,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 43 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 21:21:26,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-27 21:21:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 42. [2022-04-27 21:21:26,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:21:26,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,710 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,711 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:26,712 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 21:21:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-27 21:21:26,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:26,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:26,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-27 21:21:26,713 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-27 21:21:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:26,714 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-04-27 21:21:26,714 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-04-27 21:21:26,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:26,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:26,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:21:26,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:21:26,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-27 21:21:26,715 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 31 [2022-04-27 21:21:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:21:26,716 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-27 21:21:26,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-27 21:21:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-27 21:21:26,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:26,717 INFO L195 NwaCegarLoop]: trace histogram [15, 11, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:26,751 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-27 21:21:26,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:26,934 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:26,934 INFO L85 PathProgramCache]: Analyzing trace with hash 890325540, now seen corresponding path program 4 times [2022-04-27 21:21:26,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:26,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204867092] [2022-04-27 21:21:26,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:26,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:26,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:27,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:27,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1504#true} is VALID [2022-04-27 21:21:27,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:27,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {1521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1504#true} is VALID [2022-04-27 21:21:27,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:21:27,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:21:27,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:27,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:27,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:27,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:27,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:27,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:27,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:27,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:27,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:27,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:27,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:27,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:27,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:27,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:27,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:27,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:27,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:27,172 INFO L290 TraceCheckUtils]: 24: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:27,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:27,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:27,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:21:27,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {1520#(and (<= main_~x~0 11) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {1505#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {1505#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {1505#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {1505#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 34: Hoare triple {1505#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 35: Hoare triple {1505#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1505#false} is VALID [2022-04-27 21:21:27,174 INFO L290 TraceCheckUtils]: 36: Hoare triple {1505#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:27,175 INFO L272 TraceCheckUtils]: 37: Hoare triple {1505#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1505#false} is VALID [2022-04-27 21:21:27,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {1505#false} [58] __VERIFIER_assertENTRY-->L6: 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] {1505#false} is VALID [2022-04-27 21:21:27,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {1505#false} [59] L6-->L7: 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[] {1505#false} is VALID [2022-04-27 21:21:27,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {1505#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:27,175 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 84 proven. 132 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 21:21:27,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:27,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204867092] [2022-04-27 21:21:27,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204867092] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:21:27,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737182837] [2022-04-27 21:21:27,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 21:21:27,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:27,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:21:27,177 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-27 21:21:27,191 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-27 21:21:27,238 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 21:21:27,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:21:27,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-27 21:21:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:27,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:21:27,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1504#true} is VALID [2022-04-27 21:21:27,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:27,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:21:27,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1509#(= main_~x~0 0)} is VALID [2022-04-27 21:21:27,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:27,673 INFO L290 TraceCheckUtils]: 8: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:27,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {1510#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:27,674 INFO L290 TraceCheckUtils]: 10: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:27,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {1511#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:27,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:27,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {1512#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:27,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:27,676 INFO L290 TraceCheckUtils]: 15: Hoare triple {1513#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:27,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:27,677 INFO L290 TraceCheckUtils]: 17: Hoare triple {1514#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:27,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:27,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {1515#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:27,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:27,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {1516#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:27,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:27,680 INFO L290 TraceCheckUtils]: 23: Hoare triple {1517#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:27,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:27,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {1518#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:27,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:27,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {1519#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:21:27,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:21:27,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {1606#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:21:27,683 INFO L290 TraceCheckUtils]: 30: Hoare triple {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:21:27,683 INFO L290 TraceCheckUtils]: 31: Hoare triple {1613#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:21:27,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:21:27,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {1620#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:21:27,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:21:27,685 INFO L290 TraceCheckUtils]: 35: Hoare triple {1627#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1634#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:21:27,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {1634#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:27,686 INFO L272 TraceCheckUtils]: 37: Hoare triple {1505#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1505#false} is VALID [2022-04-27 21:21:27,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {1505#false} [58] __VERIFIER_assertENTRY-->L6: 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] {1505#false} is VALID [2022-04-27 21:21:27,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {1505#false} [59] L6-->L7: 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[] {1505#false} is VALID [2022-04-27 21:21:27,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {1505#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:27,686 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:27,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:21:28,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {1505#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:28,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {1505#false} [59] L6-->L7: 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[] {1505#false} is VALID [2022-04-27 21:21:28,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {1505#false} [58] __VERIFIER_assertENTRY-->L6: 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] {1505#false} is VALID [2022-04-27 21:21:28,262 INFO L272 TraceCheckUtils]: 37: Hoare triple {1505#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {1505#false} is VALID [2022-04-27 21:21:28,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {1662#(< (mod main_~x~0 4294967296) 268435455)} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-27 21:21:28,264 INFO L290 TraceCheckUtils]: 35: Hoare triple {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1662#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1666#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1673#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {1680#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1687#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1694#(< (mod (+ main_~x~0 9) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1701#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1708#(< (mod (+ main_~x~0 11) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1715#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,275 INFO L290 TraceCheckUtils]: 17: Hoare triple {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1722#(< (mod (+ main_~x~0 13) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,275 INFO L290 TraceCheckUtils]: 16: Hoare triple {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1729#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1736#(< (mod (+ main_~x~0 15) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1743#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1750#(< (mod (+ main_~x~0 17) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1757#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {1764#(< (mod (+ 19 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-27 21:21:28,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:28,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:28,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:28,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {1504#true} is VALID [2022-04-27 21:21:28,282 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1504#true} is VALID [2022-04-27 21:21:28,282 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 21:21:28,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737182837] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:21:28,283 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:21:28,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 36 [2022-04-27 21:21:28,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165955441] [2022-04-27 21:21:28,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:21:28,283 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 21:21:28,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:28,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:28,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:28,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-27 21:21:28,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:28,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-27 21:21:28,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=907, Unknown=0, NotChecked=0, Total=1260 [2022-04-27 21:21:28,343 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:40,422 INFO L93 Difference]: Finished difference Result 93 states and 126 transitions. [2022-04-27 21:21:40,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 21:21:40,423 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-27 21:21:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:21:40,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-27 21:21:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2022-04-27 21:21:40,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 82 transitions. [2022-04-27 21:21:40,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:40,619 INFO L225 Difference]: With dead ends: 93 [2022-04-27 21:21:40,619 INFO L226 Difference]: Without dead ends: 77 [2022-04-27 21:21:40,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=876, Invalid=2430, Unknown=0, NotChecked=0, Total=3306 [2022-04-27 21:21:40,620 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-27 21:21:40,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 93 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-27 21:21:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-27 21:21:40,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2022-04-27 21:21:40,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:21:40,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,668 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,668 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:40,670 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 21:21:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-27 21:21:40,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:40,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:40,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 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 77 states. [2022-04-27 21:21:40,671 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 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 77 states. [2022-04-27 21:21:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:21:40,672 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2022-04-27 21:21:40,672 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-27 21:21:40,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:21:40,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:21:40,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:21:40,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:21:40,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 53 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2022-04-27 21:21:40,674 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 41 [2022-04-27 21:21:40,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:21:40,674 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2022-04-27 21:21:40,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 states have internal predecessors, (76), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2022-04-27 21:21:40,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-27 21:21:40,675 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:21:40,675 INFO L195 NwaCegarLoop]: trace histogram [23, 13, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:21:40,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-27 21:21:40,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:40,876 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:21:40,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:21:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash -422126962, now seen corresponding path program 5 times [2022-04-27 21:21:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:21:40,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434186753] [2022-04-27 21:21:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:21:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:21:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:41,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:21:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:41,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {2234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:21:41,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:41,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:41,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:21:41,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:21:41,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:41,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:41,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:41,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:21:41,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {2220#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:21:41,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {2220#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:41,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:41,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:41,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:41,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:41,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:41,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:41,174 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:41,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:41,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:41,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:41,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:41,176 INFO L290 TraceCheckUtils]: 19: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:41,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:41,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:41,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:41,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:41,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:41,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:41,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:41,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:21:41,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:21:41,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:21:41,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:21:41,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:21:41,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {2233#(and (<= main_~x~0 13) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 41: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 42: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 47: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 48: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 49: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 52: Hoare triple {2216#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L272 TraceCheckUtils]: 53: Hoare triple {2216#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} [58] __VERIFIER_assertENTRY-->L6: 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] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [59] L6-->L7: 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[] {2216#false} is VALID [2022-04-27 21:21:41,182 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 266 proven. 182 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-27 21:21:41,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:21:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434186753] [2022-04-27 21:21:41,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434186753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:21:41,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303430834] [2022-04-27 21:21:41,183 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 21:21:41,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:21:41,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:21:41,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:21:41,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-27 21:21:42,451 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-04-27 21:21:42,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:21:42,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-27 21:21:42,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:21:42,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:21:42,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:42,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:21:42,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:42,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:42,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:42,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:21:42,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {2220#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2220#(= main_~x~0 0)} is VALID [2022-04-27 21:21:42,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {2220#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:42,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:21:42,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:42,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:21:43,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {2222#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:43,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:21:43,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {2223#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:43,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:21:43,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {2224#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:43,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:21:43,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {2225#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:43,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:21:43,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {2226#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:43,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:21:43,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {2227#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:43,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:21:43,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {2228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:43,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:21:43,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:43,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:21:43,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {2230#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:21:43,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:21:43,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {2231#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:21:43,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:21:43,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {2232#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:21:43,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:21:43,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {2331#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:21:43,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:21:43,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {2338#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:21:43,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:21:43,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {2345#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:21:43,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:21:43,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {2352#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:21:43,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:21:43,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {2359#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2366#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:21:43,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {2366#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2366#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:21:43,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {2366#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2373#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:21:43,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {2373#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2373#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:21:43,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {2373#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:43,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:43,014 INFO L290 TraceCheckUtils]: 47: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 49: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {2216#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L272 TraceCheckUtils]: 53: Hoare triple {2216#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} [58] __VERIFIER_assertENTRY-->L6: 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] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [59] L6-->L7: 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[] {2216#false} is VALID [2022-04-27 21:21:43,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 140 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 21:21:43,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:21:44,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {2216#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:44,214 INFO L290 TraceCheckUtils]: 55: Hoare triple {2216#false} [59] L6-->L7: 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[] {2216#false} is VALID [2022-04-27 21:21:44,214 INFO L290 TraceCheckUtils]: 54: Hoare triple {2216#false} [58] __VERIFIER_assertENTRY-->L6: 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] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L272 TraceCheckUtils]: 53: Hoare triple {2216#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 52: Hoare triple {2216#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 48: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 47: Hoare triple {2216#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {2216#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2216#false} is VALID [2022-04-27 21:21:44,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {2446#(< (mod main_~x~0 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2216#false} is VALID [2022-04-27 21:21:44,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {2450#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2446#(< (mod main_~x~0 4294967296) 65520)} is VALID [2022-04-27 21:21:44,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {2454#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2450#(or (< (mod main_~x~0 4294967296) 65520) (not (< (mod main_~x~0 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,217 INFO L290 TraceCheckUtils]: 42: Hoare triple {2454#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2454#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {2461#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2454#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {2461#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2461#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {2468#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2461#(or (< (mod (+ main_~x~0 4) 4294967296) 65520) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {2468#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2468#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {2475#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2468#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 6) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {2475#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2475#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {2482#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2475#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {2482#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2482#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {2489#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {2482#(or (< (mod (+ main_~x~0 10) 4294967296) 65520) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,224 INFO L290 TraceCheckUtils]: 32: Hoare triple {2489#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2489#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,225 INFO L290 TraceCheckUtils]: 31: Hoare triple {2496#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2489#(or (< (mod (+ main_~x~0 12) 4294967296) 65520) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {2496#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2496#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,226 INFO L290 TraceCheckUtils]: 29: Hoare triple {2503#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2496#(or (< (mod (+ main_~x~0 13) 4294967296) 65520) (not (< (mod (+ main_~x~0 13) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,226 INFO L290 TraceCheckUtils]: 28: Hoare triple {2503#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2503#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {2510#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2503#(or (< (mod (+ main_~x~0 14) 4294967296) 65520) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {2510#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2510#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {2517#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2510#(or (< (mod (+ main_~x~0 15) 4294967296) 65520) (not (< (mod (+ main_~x~0 15) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {2517#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2517#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {2524#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2517#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (< (mod (+ main_~x~0 16) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,229 INFO L290 TraceCheckUtils]: 22: Hoare triple {2524#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2524#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {2531#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 18) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2524#(or (not (< (mod (+ main_~x~0 17) 4294967296) 268435455)) (< (mod (+ main_~x~0 17) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {2531#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 18) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2531#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 18) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {2538#(or (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)) (< (mod (+ 19 main_~x~0) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2531#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 18) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {2538#(or (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)) (< (mod (+ 19 main_~x~0) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2538#(or (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)) (< (mod (+ 19 main_~x~0) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {2545#(or (< (mod (+ main_~x~0 20) 4294967296) 65520) (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2538#(or (not (< (mod (+ 19 main_~x~0) 4294967296) 268435455)) (< (mod (+ 19 main_~x~0) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {2545#(or (< (mod (+ main_~x~0 20) 4294967296) 65520) (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2545#(or (< (mod (+ main_~x~0 20) 4294967296) 65520) (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {2552#(or (< (mod (+ main_~x~0 21) 4294967296) 65520) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2545#(or (< (mod (+ main_~x~0 20) 4294967296) 65520) (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {2552#(or (< (mod (+ main_~x~0 21) 4294967296) 65520) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2552#(or (< (mod (+ main_~x~0 21) 4294967296) 65520) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {2559#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2552#(or (< (mod (+ main_~x~0 21) 4294967296) 65520) (not (< (mod (+ main_~x~0 21) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {2559#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2559#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {2566#(or (< (mod (+ 23 main_~x~0) 4294967296) 65520) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2559#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,235 INFO L290 TraceCheckUtils]: 10: Hoare triple {2566#(or (< (mod (+ 23 main_~x~0) 4294967296) 65520) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2566#(or (< (mod (+ 23 main_~x~0) 4294967296) 65520) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {2573#(or (< (mod (+ main_~x~0 24) 4294967296) 65520) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2566#(or (< (mod (+ 23 main_~x~0) 4294967296) 65520) (not (< (mod (+ 23 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {2573#(or (< (mod (+ main_~x~0 24) 4294967296) 65520) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2573#(or (< (mod (+ main_~x~0 24) 4294967296) 65520) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {2580#(or (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)) (< (mod (+ main_~x~0 25) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2573#(or (< (mod (+ main_~x~0 24) 4294967296) 65520) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-27 21:21:44,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {2580#(or (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)) (< (mod (+ main_~x~0 25) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {2580#(or (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)) (< (mod (+ main_~x~0 25) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {2215#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {2580#(or (not (< (mod (+ main_~x~0 25) 4294967296) 268435455)) (< (mod (+ main_~x~0 25) 4294967296) 65520))} is VALID [2022-04-27 21:21:44,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {2215#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:44,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2215#true} {2215#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:44,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {2215#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:44,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {2215#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {2215#true} is VALID [2022-04-27 21:21:44,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {2215#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2215#true} is VALID [2022-04-27 21:21:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 140 proven. 380 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-27 21:21:44,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303430834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:21:44,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:21:44,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 23] total 45 [2022-04-27 21:21:44,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046014243] [2022-04-27 21:21:44,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:21:44,240 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-27 21:21:44,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:21:44,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:21:44,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:21:44,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-27 21:21:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:21:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-27 21:21:44,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1437, Unknown=0, NotChecked=0, Total=1980 [2022-04-27 21:21:44,370 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,351 WARN L232 SmtUtils]: Spent 10.70s on a formula simplification. DAG size of input: 149 DAG size of output: 23 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-27 21:22:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:51,494 INFO L93 Difference]: Finished difference Result 130 states and 174 transitions. [2022-04-27 21:22:51,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-27 21:22:51,494 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-27 21:22:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:22:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 112 transitions. [2022-04-27 21:22:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 112 transitions. [2022-04-27 21:22:51,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 112 transitions. [2022-04-27 21:22:51,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:22:51,685 INFO L225 Difference]: With dead ends: 130 [2022-04-27 21:22:51,685 INFO L226 Difference]: Without dead ends: 102 [2022-04-27 21:22:51,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 66.2s TimeCoverageRelationStatistics Valid=1705, Invalid=4615, Unknown=0, NotChecked=0, Total=6320 [2022-04-27 21:22:51,687 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 76 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-27 21:22:51,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 124 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-27 21:22:51,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-27 21:22:51,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-27 21:22:51,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:22:51,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,893 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,893 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:51,896 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-27 21:22:51,896 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-27 21:22:51,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:51,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:51,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 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 102 states. [2022-04-27 21:22:51,897 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 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 102 states. [2022-04-27 21:22:51,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:22:51,899 INFO L93 Difference]: Finished difference Result 102 states and 113 transitions. [2022-04-27 21:22:51,899 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-27 21:22:51,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:22:51,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:22:51,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:22:51,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:22:51,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.1237113402061856) internal successors, (109), 97 states have internal predecessors, (109), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2022-04-27 21:22:51,902 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 57 [2022-04-27 21:22:51,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:22:51,903 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2022-04-27 21:22:51,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.088888888888889) internal successors, (94), 44 states have internal predecessors, (94), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:22:51,903 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2022-04-27 21:22:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-27 21:22:51,904 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 21:22:51,904 INFO L195 NwaCegarLoop]: trace histogram [45, 35, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 21:22:51,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-27 21:22:52,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:52,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 21:22:52,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 21:22:52,110 INFO L85 PathProgramCache]: Analyzing trace with hash -759620958, now seen corresponding path program 6 times [2022-04-27 21:22:52,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 21:22:52,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786700889] [2022-04-27 21:22:52,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 21:22:52,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 21:22:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 21:22:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:22:53,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {3269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {3228#true} is VALID [2022-04-27 21:22:53,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {3228#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:22:53,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3228#true} {3228#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:22:53,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {3228#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 21:22:53,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {3269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {3228#true} is VALID [2022-04-27 21:22:53,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {3228#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:22:53,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3228#true} {3228#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:22:53,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {3228#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:22:53,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {3228#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3233#(= main_~x~0 0)} is VALID [2022-04-27 21:22:53,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {3233#(= main_~x~0 0)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3233#(= main_~x~0 0)} is VALID [2022-04-27 21:22:53,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {3233#(= main_~x~0 0)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3234#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:53,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {3234#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3234#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 21:22:53,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {3234#(and (<= 1 main_~x~0) (<= main_~x~0 1))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3235#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:53,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {3235#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3235#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 21:22:53,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {3235#(and (<= 2 main_~x~0) (<= main_~x~0 2))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3236#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:53,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {3236#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3236#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 21:22:53,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {3236#(and (<= main_~x~0 3) (<= 3 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3237#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:53,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {3237#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3237#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 21:22:53,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {3237#(and (<= main_~x~0 4) (<= 4 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3238#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:53,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {3238#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3238#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-27 21:22:53,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {3238#(and (<= 5 main_~x~0) (<= main_~x~0 5))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3239#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:53,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {3239#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3239#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-27 21:22:53,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {3239#(and (<= 6 main_~x~0) (<= main_~x~0 6))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3240#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:53,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {3240#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3240#(and (<= main_~x~0 7) (<= 7 main_~x~0))} is VALID [2022-04-27 21:22:53,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {3240#(and (<= main_~x~0 7) (<= 7 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3241#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:53,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {3241#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3241#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-27 21:22:53,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {3241#(and (<= main_~x~0 8) (<= 8 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3242#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:22:53,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {3242#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3242#(and (<= main_~x~0 9) (<= 9 main_~x~0))} is VALID [2022-04-27 21:22:53,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {3242#(and (<= main_~x~0 9) (<= 9 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3243#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:22:53,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {3243#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3243#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-27 21:22:53,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {3243#(and (<= main_~x~0 10) (<= 10 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3244#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:22:53,083 INFO L290 TraceCheckUtils]: 28: Hoare triple {3244#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3244#(and (<= main_~x~0 11) (<= 11 main_~x~0))} is VALID [2022-04-27 21:22:53,084 INFO L290 TraceCheckUtils]: 29: Hoare triple {3244#(and (<= main_~x~0 11) (<= 11 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:22:53,084 INFO L290 TraceCheckUtils]: 30: Hoare triple {3245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-27 21:22:53,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {3245#(and (<= main_~x~0 12) (<= 12 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3246#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:22:53,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {3246#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3246#(and (<= main_~x~0 13) (<= 13 main_~x~0))} is VALID [2022-04-27 21:22:53,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {3246#(and (<= main_~x~0 13) (<= 13 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3247#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:22:53,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {3247#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3247#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-27 21:22:53,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {3247#(and (<= 14 main_~x~0) (<= main_~x~0 14))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3248#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:22:53,087 INFO L290 TraceCheckUtils]: 36: Hoare triple {3248#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3248#(and (<= 15 main_~x~0) (<= main_~x~0 15))} is VALID [2022-04-27 21:22:53,087 INFO L290 TraceCheckUtils]: 37: Hoare triple {3248#(and (<= 15 main_~x~0) (<= main_~x~0 15))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3249#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:22:53,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {3249#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3249#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-27 21:22:53,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {3249#(and (<= main_~x~0 16) (<= 16 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3250#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:22:53,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {3250#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3250#(and (<= 17 main_~x~0) (<= main_~x~0 17))} is VALID [2022-04-27 21:22:53,089 INFO L290 TraceCheckUtils]: 41: Hoare triple {3250#(and (<= 17 main_~x~0) (<= main_~x~0 17))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3251#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:22:53,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {3251#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3251#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-27 21:22:53,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {3251#(and (<= main_~x~0 18) (<= 18 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3252#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:22:53,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {3252#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3252#(and (<= 19 main_~x~0) (<= main_~x~0 19))} is VALID [2022-04-27 21:22:53,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {3252#(and (<= 19 main_~x~0) (<= main_~x~0 19))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3253#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:22:53,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {3253#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3253#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-27 21:22:53,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {3253#(and (<= main_~x~0 20) (<= 20 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3254#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:22:53,093 INFO L290 TraceCheckUtils]: 48: Hoare triple {3254#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3254#(and (<= 21 main_~x~0) (<= main_~x~0 21))} is VALID [2022-04-27 21:22:53,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {3254#(and (<= 21 main_~x~0) (<= main_~x~0 21))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3255#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:22:53,094 INFO L290 TraceCheckUtils]: 50: Hoare triple {3255#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3255#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-27 21:22:53,094 INFO L290 TraceCheckUtils]: 51: Hoare triple {3255#(and (<= 22 main_~x~0) (<= main_~x~0 22))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3256#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:22:53,095 INFO L290 TraceCheckUtils]: 52: Hoare triple {3256#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3256#(and (<= 23 main_~x~0) (<= main_~x~0 23))} is VALID [2022-04-27 21:22:53,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {3256#(and (<= 23 main_~x~0) (<= main_~x~0 23))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3257#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:22:53,096 INFO L290 TraceCheckUtils]: 54: Hoare triple {3257#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3257#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-27 21:22:53,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {3257#(and (<= main_~x~0 24) (<= 24 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3258#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:22:53,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {3258#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3258#(and (<= main_~x~0 25) (<= 25 main_~x~0))} is VALID [2022-04-27 21:22:53,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {3258#(and (<= main_~x~0 25) (<= 25 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3259#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:22:53,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {3259#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3259#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-27 21:22:53,099 INFO L290 TraceCheckUtils]: 59: Hoare triple {3259#(and (<= main_~x~0 26) (<= 26 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3260#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:22:53,099 INFO L290 TraceCheckUtils]: 60: Hoare triple {3260#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3260#(and (<= 27 main_~x~0) (<= main_~x~0 27))} is VALID [2022-04-27 21:22:53,100 INFO L290 TraceCheckUtils]: 61: Hoare triple {3260#(and (<= 27 main_~x~0) (<= main_~x~0 27))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3261#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:22:53,100 INFO L290 TraceCheckUtils]: 62: Hoare triple {3261#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3261#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-27 21:22:53,101 INFO L290 TraceCheckUtils]: 63: Hoare triple {3261#(and (<= 28 main_~x~0) (<= main_~x~0 28))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3262#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:22:53,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {3262#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3262#(and (<= main_~x~0 29) (<= 29 main_~x~0))} is VALID [2022-04-27 21:22:53,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {3262#(and (<= main_~x~0 29) (<= 29 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3263#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:22:53,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {3263#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3263#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-27 21:22:53,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {3263#(and (<= 30 main_~x~0) (<= main_~x~0 30))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3264#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:22:53,103 INFO L290 TraceCheckUtils]: 68: Hoare triple {3264#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3264#(and (<= 31 main_~x~0) (<= main_~x~0 31))} is VALID [2022-04-27 21:22:53,104 INFO L290 TraceCheckUtils]: 69: Hoare triple {3264#(and (<= 31 main_~x~0) (<= main_~x~0 31))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3265#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:22:53,104 INFO L290 TraceCheckUtils]: 70: Hoare triple {3265#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3265#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-27 21:22:53,104 INFO L290 TraceCheckUtils]: 71: Hoare triple {3265#(and (<= main_~x~0 32) (<= 32 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3266#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:22:53,105 INFO L290 TraceCheckUtils]: 72: Hoare triple {3266#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3266#(and (<= main_~x~0 33) (<= 33 main_~x~0))} is VALID [2022-04-27 21:22:53,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {3266#(and (<= main_~x~0 33) (<= 33 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:22:53,106 INFO L290 TraceCheckUtils]: 74: Hoare triple {3267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-27 21:22:53,107 INFO L290 TraceCheckUtils]: 75: Hoare triple {3267#(and (<= main_~x~0 34) (<= 34 main_~x~0))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3268#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:22:53,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {3268#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3268#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {3268#(and (<= main_~x~0 35) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 80: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 81: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 82: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 84: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 85: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,108 INFO L290 TraceCheckUtils]: 86: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 87: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 88: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 89: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 90: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 91: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 92: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 93: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 94: Hoare triple {3229#false} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 95: Hoare triple {3229#false} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,109 INFO L290 TraceCheckUtils]: 96: Hoare triple {3229#false} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,110 INFO L272 TraceCheckUtils]: 97: Hoare triple {3229#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3229#false} is VALID [2022-04-27 21:22:53,110 INFO L290 TraceCheckUtils]: 98: Hoare triple {3229#false} [58] __VERIFIER_assertENTRY-->L6: 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] {3229#false} is VALID [2022-04-27 21:22:53,110 INFO L290 TraceCheckUtils]: 99: Hoare triple {3229#false} [59] L6-->L7: 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[] {3229#false} is VALID [2022-04-27 21:22:53,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {3229#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:22:53,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 684 proven. 1260 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-27 21:22:53,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 21:22:53,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786700889] [2022-04-27 21:22:53,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786700889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 21:22:53,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70720906] [2022-04-27 21:22:53,112 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 21:22:53,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:22:53,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 21:22:53,128 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 21:22:53,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-27 21:23:07,078 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2022-04-27 21:23:07,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 21:23:07,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-27 21:23:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 21:23:07,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 21:23:09,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {3228#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {3228#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {3228#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3228#true} {3228#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {3228#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {3228#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 16: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 18: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 24: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 25: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,255 INFO L290 TraceCheckUtils]: 26: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 27: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 28: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 29: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 35: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 36: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,276 INFO L290 TraceCheckUtils]: 41: Hoare triple {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3397#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,277 INFO L290 TraceCheckUtils]: 42: Hoare triple {3397#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3397#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {3397#(< (mod (+ main_~x~0 4294967294) 4294967296) 65520)} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3404#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {3404#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3404#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {3404#(and (< (mod (+ main_~x~0 4294967293) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3411#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {3411#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3411#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {3411#(and (< (mod (+ main_~x~0 4294967295) 4294967296) 65520) (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3418#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,289 INFO L290 TraceCheckUtils]: 48: Hoare triple {3418#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3418#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {3418#(and (< (mod (+ 4294967291 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3425#(and (< (mod (+ 4294967290 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,295 INFO L290 TraceCheckUtils]: 50: Hoare triple {3425#(and (< (mod (+ 4294967290 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3425#(and (< (mod (+ 4294967290 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {3425#(and (< (mod (+ 4294967290 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3432#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {3432#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3432#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,307 INFO L290 TraceCheckUtils]: 53: Hoare triple {3432#(and (< (mod (+ main_~x~0 4294967289) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3439#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,307 INFO L290 TraceCheckUtils]: 54: Hoare triple {3439#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3439#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {3439#(and (< (mod (+ 4294967288 main_~x~0) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3446#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {3446#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3446#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,313 INFO L290 TraceCheckUtils]: 57: Hoare triple {3446#(and (< (mod (+ main_~x~0 4294967287) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3453#(and (< (mod (+ main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,313 INFO L290 TraceCheckUtils]: 58: Hoare triple {3453#(and (< (mod (+ main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3453#(and (< (mod (+ main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 59: Hoare triple {3453#(and (< (mod (+ main_~x~0 4294967286) 4294967296) 65520) (< (mod (+ main_~x~0 4294967295) 4294967296) 65520))} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 60: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 61: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 62: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 65: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 66: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 67: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:09,315 INFO L290 TraceCheckUtils]: 74: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:09,321 INFO L290 TraceCheckUtils]: 75: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,321 INFO L290 TraceCheckUtils]: 76: Hoare triple {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,322 INFO L290 TraceCheckUtils]: 77: Hoare triple {3390#(< (mod (+ main_~x~0 4294967295) 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3514#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,322 INFO L290 TraceCheckUtils]: 78: Hoare triple {3514#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3514#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {3514#(< (mod (+ main_~x~0 4294967293) 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3521#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,323 INFO L290 TraceCheckUtils]: 80: Hoare triple {3521#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3521#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,324 INFO L290 TraceCheckUtils]: 81: Hoare triple {3521#(< (mod (+ 4294967291 main_~x~0) 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3528#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {3528#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3528#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,325 INFO L290 TraceCheckUtils]: 83: Hoare triple {3528#(< (mod (+ main_~x~0 4294967289) 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3535#(< (mod (+ main_~x~0 4294967287) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,325 INFO L290 TraceCheckUtils]: 84: Hoare triple {3535#(< (mod (+ main_~x~0 4294967287) 4294967296) 65520)} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3535#(< (mod (+ main_~x~0 4294967287) 4294967296) 65520)} is VALID [2022-04-27 21:23:09,330 INFO L290 TraceCheckUtils]: 85: Hoare triple {3535#(< (mod (+ main_~x~0 4294967287) 4294967296) 65520)} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3542#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 65520) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)))} is VALID [2022-04-27 21:23:09,330 INFO L290 TraceCheckUtils]: 86: Hoare triple {3542#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 65520) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3542#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 65520) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)))} is VALID [2022-04-27 21:23:09,343 INFO L290 TraceCheckUtils]: 87: Hoare triple {3542#(and (< (mod (+ main_~x~0 4294967285) 4294967296) 65520) (not (< (mod (+ main_~x~0 4294967294) 4294967296) 65520)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3549#(and (< (mod (+ 4294967283 main_~x~0) 4294967296) 65520) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520)))} is VALID [2022-04-27 21:23:09,344 INFO L290 TraceCheckUtils]: 88: Hoare triple {3549#(and (< (mod (+ 4294967283 main_~x~0) 4294967296) 65520) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3549#(and (< (mod (+ 4294967283 main_~x~0) 4294967296) 65520) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520)))} is VALID [2022-04-27 21:23:09,345 INFO L290 TraceCheckUtils]: 89: Hoare triple {3549#(and (< (mod (+ 4294967283 main_~x~0) 4294967296) 65520) (not (< (mod (+ 4294967292 main_~x~0) 4294967296) 65520)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3556#(and (<= 65520 (mod (+ 4294967290 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 4294967281) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,345 INFO L290 TraceCheckUtils]: 90: Hoare triple {3556#(and (<= 65520 (mod (+ 4294967290 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 4294967281) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3556#(and (<= 65520 (mod (+ 4294967290 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 4294967281) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,346 INFO L290 TraceCheckUtils]: 91: Hoare triple {3556#(and (<= 65520 (mod (+ 4294967290 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 4294967281) 4294967296) 65520))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3563#(and (< (mod (+ main_~x~0 4294967279) 4294967296) 65520) (<= 65520 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:23:09,346 INFO L290 TraceCheckUtils]: 92: Hoare triple {3563#(and (< (mod (+ main_~x~0 4294967279) 4294967296) 65520) (<= 65520 (mod (+ 4294967288 main_~x~0) 4294967296)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3563#(and (< (mod (+ main_~x~0 4294967279) 4294967296) 65520) (<= 65520 (mod (+ 4294967288 main_~x~0) 4294967296)))} is VALID [2022-04-27 21:23:09,347 INFO L290 TraceCheckUtils]: 93: Hoare triple {3563#(and (< (mod (+ main_~x~0 4294967279) 4294967296) 65520) (<= 65520 (mod (+ 4294967288 main_~x~0) 4294967296)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3570#(and (<= 65520 (mod (+ main_~x~0 4294967286) 4294967296)) (< (mod (+ main_~x~0 4294967277) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,348 INFO L290 TraceCheckUtils]: 94: Hoare triple {3570#(and (<= 65520 (mod (+ main_~x~0 4294967286) 4294967296)) (< (mod (+ main_~x~0 4294967277) 4294967296) 65520))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3570#(and (<= 65520 (mod (+ main_~x~0 4294967286) 4294967296)) (< (mod (+ main_~x~0 4294967277) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,348 INFO L290 TraceCheckUtils]: 95: Hoare triple {3570#(and (<= 65520 (mod (+ main_~x~0 4294967286) 4294967296)) (< (mod (+ main_~x~0 4294967277) 4294967296) 65520))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3577#(and (<= 65520 (mod (+ main_~x~0 4294967284) 4294967296)) (< (mod (+ 4294967275 main_~x~0) 4294967296) 65520))} is VALID [2022-04-27 21:23:09,351 INFO L290 TraceCheckUtils]: 96: Hoare triple {3577#(and (<= 65520 (mod (+ main_~x~0 4294967284) 4294967296)) (< (mod (+ 4294967275 main_~x~0) 4294967296) 65520))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:23:09,351 INFO L272 TraceCheckUtils]: 97: Hoare triple {3229#false} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3229#false} is VALID [2022-04-27 21:23:09,351 INFO L290 TraceCheckUtils]: 98: Hoare triple {3229#false} [58] __VERIFIER_assertENTRY-->L6: 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] {3229#false} is VALID [2022-04-27 21:23:09,351 INFO L290 TraceCheckUtils]: 99: Hoare triple {3229#false} [59] L6-->L7: 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[] {3229#false} is VALID [2022-04-27 21:23:09,351 INFO L290 TraceCheckUtils]: 100: Hoare triple {3229#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:23:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 953 proven. 470 refuted. 0 times theorem prover too weak. 602 trivial. 0 not checked. [2022-04-27 21:23:09,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 21:23:12,497 INFO L290 TraceCheckUtils]: 100: Hoare triple {3229#false} [61] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3229#false} is VALID [2022-04-27 21:23:12,497 INFO L290 TraceCheckUtils]: 99: Hoare triple {3596#(not (<= __VERIFIER_assert_~cond 0))} [59] L6-->L7: 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[] {3229#false} is VALID [2022-04-27 21:23:12,497 INFO L290 TraceCheckUtils]: 98: Hoare triple {3600#(< 0 |__VERIFIER_assert_#in~cond|)} [58] __VERIFIER_assertENTRY-->L6: 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] {3596#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 21:23:12,498 INFO L272 TraceCheckUtils]: 97: Hoare triple {3604#(= (mod main_~x~0 2) 0)} [54] L15-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_9 2) 0) 1 0)) InVars {main_~x~0=v_main_~x~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0] {3600#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 21:23:12,498 INFO L290 TraceCheckUtils]: 96: Hoare triple {3608#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [52] L16-2-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {3604#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 21:23:12,499 INFO L290 TraceCheckUtils]: 95: Hoare triple {3612#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3608#(or (< (mod main_~x~0 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,500 INFO L290 TraceCheckUtils]: 94: Hoare triple {3616#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3612#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,501 INFO L290 TraceCheckUtils]: 93: Hoare triple {3620#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3616#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,501 INFO L290 TraceCheckUtils]: 92: Hoare triple {3620#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3620#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,502 INFO L290 TraceCheckUtils]: 91: Hoare triple {3627#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3620#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,502 INFO L290 TraceCheckUtils]: 90: Hoare triple {3627#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3627#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,526 INFO L290 TraceCheckUtils]: 89: Hoare triple {3634#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3627#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {3634#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3634#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,527 INFO L290 TraceCheckUtils]: 87: Hoare triple {3641#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3634#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,528 INFO L290 TraceCheckUtils]: 86: Hoare triple {3641#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3641#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,529 INFO L290 TraceCheckUtils]: 85: Hoare triple {3648#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3641#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {3648#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3648#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,530 INFO L290 TraceCheckUtils]: 83: Hoare triple {3655#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3648#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,531 INFO L290 TraceCheckUtils]: 82: Hoare triple {3655#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3655#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,531 INFO L290 TraceCheckUtils]: 81: Hoare triple {3662#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3655#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,532 INFO L290 TraceCheckUtils]: 80: Hoare triple {3662#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3662#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,533 INFO L290 TraceCheckUtils]: 79: Hoare triple {3669#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)) (= (mod main_~x~0 2) 0))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3662#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,533 INFO L290 TraceCheckUtils]: 78: Hoare triple {3669#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)) (= (mod main_~x~0 2) 0))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3669#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,534 INFO L290 TraceCheckUtils]: 77: Hoare triple {3676#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} [56] L16-->L16-2: Formula: (and (= v_main_~x~0_4 (+ v_main_~x~0_5 2)) (not (< (mod v_main_~x~0_5 4294967296) 65520))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[main_~x~0] {3669#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-27 21:23:12,535 INFO L290 TraceCheckUtils]: 76: Hoare triple {3676#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3676#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 21:23:12,548 INFO L290 TraceCheckUtils]: 75: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3676#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (= (mod main_~x~0 2) 0) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-27 21:23:12,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,548 INFO L290 TraceCheckUtils]: 73: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,548 INFO L290 TraceCheckUtils]: 72: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 71: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 70: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 69: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 66: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 65: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 64: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 63: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 62: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 61: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 60: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,549 INFO L290 TraceCheckUtils]: 59: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 52: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 51: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 50: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 47: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 46: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,550 INFO L290 TraceCheckUtils]: 45: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 44: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 39: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 38: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 37: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 36: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 28: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 9: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {3228#true} [55] L16-->L16-2: Formula: (and (< (mod v_main_~x~0_3 4294967296) 65520) (= (+ v_main_~x~0_3 1) v_main_~x~0_2)) InVars {main_~x~0=v_main_~x~0_3} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post4=|v_main_#t~post4_1|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {3228#true} [53] L16-2-->L16: Formula: (< (mod v_main_~x~0_1 4294967296) 268435455) InVars {main_~x~0=v_main_~x~0_1} OutVars{main_~x~0=v_main_~x~0_1} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {3228#true} [49] mainENTRY-->L16-2: Formula: (= v_main_~x~0_6 0) InVars {} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[main_~x~0] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {3228#true} [46] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3228#true} {3228#true} [64] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {3228#true} [50] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {3228#true} [47] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (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_#length_1| 2) 13) (= (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{#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[#NULL.offset, #NULL.base] {3228#true} is VALID [2022-04-27 21:23:12,554 INFO L272 TraceCheckUtils]: 0: Hoare triple {3228#true} [45] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3228#true} is VALID [2022-04-27 21:23:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 735 proven. 100 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2022-04-27 21:23:12,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70720906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 21:23:12,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 21:23:12,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 22, 17] total 74 [2022-04-27 21:23:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492078115] [2022-04-27 21:23:12,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 21:23:12,556 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-27 21:23:12,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 21:23:12,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:12,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:12,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-27 21:23:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 21:23:12,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-27 21:23:12,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1358, Invalid=4044, Unknown=0, NotChecked=0, Total=5402 [2022-04-27 21:23:12,898 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:30,916 INFO L93 Difference]: Finished difference Result 193 states and 250 transitions. [2022-04-27 21:23:30,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-27 21:23:30,917 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2022-04-27 21:23:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 21:23:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 156 transitions. [2022-04-27 21:23:30,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 156 transitions. [2022-04-27 21:23:30,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 156 transitions. [2022-04-27 21:23:31,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 21:23:31,383 INFO L225 Difference]: With dead ends: 193 [2022-04-27 21:23:31,383 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 21:23:31,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 179 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2423 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=3276, Invalid=14280, Unknown=0, NotChecked=0, Total=17556 [2022-04-27 21:23:31,387 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 168 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-27 21:23:31,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 79 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 2426 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-27 21:23:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 21:23:31,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 21:23:31,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 21:23:31,388 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-27 21:23:31,388 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-27 21:23:31,388 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-27 21:23:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:31,388 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:23:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:23:31,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:31,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:31,388 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-27 21:23:31,388 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-27 21:23:31,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 21:23:31,388 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 21:23:31,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:23:31,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:31,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 21:23:31,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 21:23:31,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 21:23:31,389 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-27 21:23:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 21:23:31,389 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 101 [2022-04-27 21:23:31,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 21:23:31,389 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 21:23:31,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 2.0547945205479454) internal successors, (150), 72 states have internal predecessors, (150), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 21:23:31,389 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 21:23:31,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 21:23:31,392 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 21:23:31,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-27 21:23:31,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 21:23:31,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 21:23:53,780 WARN L232 SmtUtils]: Spent 20.31s on a formula simplification. DAG size of input: 369 DAG size of output: 12 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-27 21:23:53,788 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 21:23:53,788 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:23:53,788 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:23:53,788 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 21:23:53,788 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 21:23:53,788 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 21:23:53,788 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 21:23:53,788 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 12 24) the Hoare annotation is: true [2022-04-27 21:23:53,788 INFO L895 garLoopResultBuilder]: At program point L16-2(lines 15 21) the Hoare annotation is: (or (< (mod (+ main_~x~0 4294967295) 4294967296) 65520) (= (mod main_~x~0 2) 0)) [2022-04-27 21:23:53,788 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 15 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 21:23:53,788 INFO L899 garLoopResultBuilder]: For program point L16(lines 16 20) no Hoare annotation was computed. [2022-04-27 21:23:53,788 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 12 24) no Hoare annotation was computed. [2022-04-27 21:23:53,788 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 12 24) no Hoare annotation was computed. [2022-04-27 21:23:53,789 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 21:23:53,789 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 21:23:53,789 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 21:23:53,789 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:23:53,789 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 21:23:53,789 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 21:23:53,791 INFO L356 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1] [2022-04-27 21:23:53,792 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 21:23:53,795 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:23:53,795 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:23:53,795 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 21:23:53,799 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 21:23:53,799 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 21:23:53,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 09:23:53 BasicIcfg [2022-04-27 21:23:53,805 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 21:23:53,806 INFO L158 Benchmark]: Toolchain (without parser) took 153020.70ms. Allocated memory was 209.7MB in the beginning and 352.3MB in the end (delta: 142.6MB). Free memory was 182.0MB in the beginning and 196.2MB in the end (delta: -14.2MB). Peak memory consumption was 170.2MB. Max. memory is 8.0GB. [2022-04-27 21:23:53,806 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 21:23:53,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 169.63ms. Allocated memory is still 209.7MB. Free memory was 181.8MB in the beginning and 180.7MB in the end (delta: 1.1MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. [2022-04-27 21:23:53,806 INFO L158 Benchmark]: Boogie Preprocessor took 25.00ms. Allocated memory is still 209.7MB. Free memory was 180.7MB in the beginning and 179.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:23:53,806 INFO L158 Benchmark]: RCFGBuilder took 215.79ms. Allocated memory is still 209.7MB. Free memory was 179.2MB in the beginning and 169.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 21:23:53,807 INFO L158 Benchmark]: IcfgTransformer took 14.43ms. Allocated memory is still 209.7MB. Free memory was 168.7MB in the beginning and 167.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 21:23:53,807 INFO L158 Benchmark]: TraceAbstraction took 152591.84ms. Allocated memory was 209.7MB in the beginning and 352.3MB in the end (delta: 142.6MB). Free memory was 166.9MB in the beginning and 196.2MB in the end (delta: -29.3MB). Peak memory consumption was 156.0MB. Max. memory is 8.0GB. [2022-04-27 21:23:53,808 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 169.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 169.63ms. Allocated memory is still 209.7MB. Free memory was 181.8MB in the beginning and 180.7MB in the end (delta: 1.1MB). Peak memory consumption was 10.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.00ms. Allocated memory is still 209.7MB. Free memory was 180.7MB in the beginning and 179.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.79ms. Allocated memory is still 209.7MB. Free memory was 179.2MB in the beginning and 169.0MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 14.43ms. Allocated memory is still 209.7MB. Free memory was 168.7MB in the beginning and 167.6MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 152591.84ms. Allocated memory was 209.7MB in the beginning and 352.3MB in the end (delta: 142.6MB). Free memory was 166.9MB in the beginning and 196.2MB in the end (delta: -29.3MB). Peak memory consumption was 156.0MB. 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: 7]: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 152.5s, OverallIterations: 9, TraceHistogramMax: 45, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 100.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 22.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 408 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 407 mSDsluCounter, 485 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 379 mSDsCounter, 909 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4106 IncrementalHoareTripleChecker+Invalid, 5015 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 909 mSolverCounterUnsat, 106 mSDtfsCounter, 4106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 843 GetRequests, 485 SyntacticMatches, 12 SemanticMatches, 346 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3623 ImplicationChecksByTransitivity, 94.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=8, InterpolantAutomatonStates: 179, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 17 PreInvPairs, 97 NumberOfFragments, 29 HoareAnnotationTreeSize, 17 FomulaSimplifications, 66 FormulaSimplificationTreeSizeReduction, 1.8s HoareSimplificationTime, 7 FomulaSimplificationsInter, 77883 FormulaSimplificationTreeSizeReductionInter, 20.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 15.4s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 580 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 836 ConstructedInterpolants, 0 QuantifiedInterpolants, 4190 SizeOfPredicates, 6 NumberOfNonLiveVariables, 721 ConjunctsInSsa, 172 ConjunctsInUnsatCore, 23 InterpolantComputations, 2 PerfectInterpolantSequences, 5210/8715 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: 15]: Loop Invariant Derived loop invariant: (x + 4294967295) % 4294967296 < 65520 || x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 21:23:53,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...