/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 01:03:53,728 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 01:03:53,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 01:03:53,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 01:03:53,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 01:03:53,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 01:03:53,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 01:03:53,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 01:03:53,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 01:03:53,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 01:03:53,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 01:03:53,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 01:03:53,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 01:03:53,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 01:03:53,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 01:03:53,799 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 01:03:53,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 01:03:53,800 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 01:03:53,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 01:03:53,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 01:03:53,807 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 01:03:53,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 01:03:53,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 01:03:53,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 01:03:53,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 01:03:53,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 01:03:53,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 01:03:53,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 01:03:53,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 01:03:53,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 01:03:53,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 01:03:53,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 01:03:53,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 01:03:53,818 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 01:03:53,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 01:03:53,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 01:03:53,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 01:03:53,819 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 01:03:53,819 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 01:03:53,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 01:03:53,820 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 01:03:53,821 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 01:03:53,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 01:03:53,845 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 01:03:53,846 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 01:03:53,846 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 01:03:53,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 01:03:53,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 01:03:53,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 01:03:53,847 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 01:03:53,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 01:03:53,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 01:03:53,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 01:03:53,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 01:03:53,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 01:03:53,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:03:53,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 01:03:53,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 01:03:53,850 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 01:03:53,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 01:03:53,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 01:03:53,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 01:03:53,850 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 01:03:53,850 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 01:03:53,851 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 01:03:53,851 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 01:03:54,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 01:03:54,049 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 01:03:54,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 01:03:54,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 01:03:54,052 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 01:03:54,053 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-15 01:03:54,110 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88d74a7e/2eb809c6bb084b60abf69ce37b0f8a0f/FLAGc5aa9799e [2022-04-15 01:03:54,456 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 01:03:54,460 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-04-15 01:03:54,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88d74a7e/2eb809c6bb084b60abf69ce37b0f8a0f/FLAGc5aa9799e [2022-04-15 01:03:54,472 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88d74a7e/2eb809c6bb084b60abf69ce37b0f8a0f [2022-04-15 01:03:54,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 01:03:54,475 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 01:03:54,477 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 01:03:54,477 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 01:03:54,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 01:03:54,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,481 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbb12e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54, skipping insertion in model container [2022-04-15 01:03:54,481 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,488 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 01:03:54,498 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 01:03:54,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-04-15 01:03:54,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:03:54,629 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 01:03:54,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-04-15 01:03:54,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 01:03:54,649 INFO L208 MainTranslator]: Completed translation [2022-04-15 01:03:54,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54 WrapperNode [2022-04-15 01:03:54,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 01:03:54,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 01:03:54,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 01:03:54,651 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 01:03:54,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,661 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 01:03:54,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 01:03:54,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 01:03:54,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 01:03:54,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 01:03:54,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:03:54,709 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 01:03:54,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 01:03:54,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 01:03:54,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 01:03:54,735 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 01:03:54,735 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 01:03:54,735 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 01:03:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 01:03:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 01:03:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 01:03:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 01:03:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 01:03:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 01:03:54,783 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 01:03:54,785 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 01:03:54,952 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 01:03:54,957 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 01:03:54,957 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 01:03:54,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:03:54 BoogieIcfgContainer [2022-04-15 01:03:54,958 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 01:03:54,959 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 01:03:54,959 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 01:03:54,959 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 01:03:54,961 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:03:54" (1/1) ... [2022-04-15 01:03:54,963 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 01:03:54,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:03:54 BasicIcfg [2022-04-15 01:03:54,981 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 01:03:54,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 01:03:54,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 01:03:54,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 01:03:54,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:03:54" (1/4) ... [2022-04-15 01:03:54,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b519fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:03:54, skipping insertion in model container [2022-04-15 01:03:54,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:03:54" (2/4) ... [2022-04-15 01:03:54,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b519fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:03:54, skipping insertion in model container [2022-04-15 01:03:54,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:03:54" (3/4) ... [2022-04-15 01:03:54,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b519fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:03:54, skipping insertion in model container [2022-04-15 01:03:54,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 01:03:54" (4/4) ... [2022-04-15 01:03:54,986 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.cqvasr [2022-04-15 01:03:54,989 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 01:03:54,989 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 01:03:55,029 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 01:03:55,034 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 01:03:55,034 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 01:03:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 01:03:55,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 01:03:55,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:03:55,062 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:03:55,062 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:03:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:03:55,066 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-04-15 01:03:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:03:55,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630630081] [2022-04-15 01:03:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:03:55,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:03:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:03:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:55,233 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {28#true} is VALID [2022-04-15 01:03:55,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:03:55,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:03:55,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:03:55,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {28#true} is VALID [2022-04-15 01:03:55,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:03:55,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:03:55,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#true} is VALID [2022-04-15 01:03:55,236 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {28#true} is VALID [2022-04-15 01:03:55,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} [103] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {29#false} is VALID [2022-04-15 01:03:55,237 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} [107] L23-2-->L29-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} [110] L29-1-->L35-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} [113] L35-1-->L41-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} [116] L41-1-->L47-1: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} [119] L47-1-->L47-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,237 INFO L272 TraceCheckUtils]: 13: Hoare triple {29#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {29#false} is VALID [2022-04-15 01:03:55,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {29#false} is VALID [2022-04-15 01:03:55,238 INFO L290 TraceCheckUtils]: 15: Hoare triple {29#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#false} is VALID [2022-04-15 01:03:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:55,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:03:55,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630630081] [2022-04-15 01:03:55,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630630081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:03:55,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:03:55,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 01:03:55,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047433428] [2022-04-15 01:03:55,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:03:55,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 01:03:55,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:03:55,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:55,280 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 01:03:55,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:03:55,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 01:03:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:03:55,297 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:55,379 INFO L93 Difference]: Finished difference Result 43 states and 66 transitions. [2022-04-15 01:03:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 01:03:55,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 01:03:55,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:03:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 01:03:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-04-15 01:03:55,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-04-15 01:03:55,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:55,474 INFO L225 Difference]: With dead ends: 43 [2022-04-15 01:03:55,474 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 01:03:55,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 01:03:55,481 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 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-15 01:03:55,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:03:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 01:03:55,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 01:03:55,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:03:55,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,509 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,509 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:55,514 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 01:03:55,514 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 01:03:55,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:55,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:55,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 01:03:55,515 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-15 01:03:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:55,517 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-04-15 01:03:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 01:03:55,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:55,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:55,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:03:55,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:03:55,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-04-15 01:03:55,530 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-04-15 01:03:55,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:03:55,530 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-04-15 01:03:55,532 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-04-15 01:03:55,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 01:03:55,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:03:55,532 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:03:55,532 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 01:03:55,533 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:03:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:03:55,536 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-04-15 01:03:55,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:03:55,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615371013] [2022-04-15 01:03:55,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:03:55,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:03:55,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:55,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:03:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:55,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {152#true} is VALID [2022-04-15 01:03:55,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 01:03:55,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {152#true} {152#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 01:03:55,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:03:55,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {152#true} is VALID [2022-04-15 01:03:55,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 01:03:55,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 01:03:55,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {152#true} is VALID [2022-04-15 01:03:55,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {157#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 01:03:55,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {158#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 01:03:55,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:03:55,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:03:55,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:03:55,896 INFO L290 TraceCheckUtils]: 10: Hoare triple {159#(and (= main_~z~0 0) (= main_~n~0 main_~x~0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:03:55,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:03:55,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:03:55,898 INFO L272 TraceCheckUtils]: 13: Hoare triple {160#(and (= main_~z~0 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:03:55,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {161#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {162#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:03:55,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {162#(not (= __VERIFIER_assert_~cond 0))} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {153#false} is VALID [2022-04-15 01:03:55,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {153#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {153#false} is VALID [2022-04-15 01:03:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:55,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:03:55,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615371013] [2022-04-15 01:03:55,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615371013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 01:03:55,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 01:03:55,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 01:03:55,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934138624] [2022-04-15 01:03:55,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 01:03:55,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 01:03:55,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:03:55,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:55,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:55,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 01:03:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:03:55,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 01:03:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:03:55,919 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:56,175 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2022-04-15 01:03:56,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 01:03:56,176 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 01:03:56,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:03:56,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 01:03:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2022-04-15 01:03:56,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 53 transitions. [2022-04-15 01:03:56,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:56,225 INFO L225 Difference]: With dead ends: 38 [2022-04-15 01:03:56,225 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 01:03:56,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-15 01:03:56,230 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 01:03:56,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 01:03:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 01:03:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 01:03:56,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:03:56,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,237 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,237 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:56,238 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 01:03:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 01:03:56,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:56,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:56,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 01:03:56,240 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 01:03:56,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:56,241 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-04-15 01:03:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 01:03:56,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:56,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:56,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:03:56,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:03:56,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-04-15 01:03:56,243 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 17 [2022-04-15 01:03:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:03:56,243 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-04-15 01:03:56,244 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-04-15 01:03:56,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 01:03:56,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:03:56,245 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:03:56,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 01:03:56,246 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:03:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:03:56,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1504591698, now seen corresponding path program 1 times [2022-04-15 01:03:56,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:03:56,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670013300] [2022-04-15 01:03:56,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:03:56,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:03:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:56,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:03:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:56,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {295#true} is VALID [2022-04-15 01:03:56,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {295#true} {295#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:03:56,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {303#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {295#true} is VALID [2022-04-15 01:03:56,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,356 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {300#(= main_~y~0 0)} is VALID [2022-04-15 01:03:56,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:56,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:56,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {302#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-15 01:03:56,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {302#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,372 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,373 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,373 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,373 INFO L272 TraceCheckUtils]: 14: Hoare triple {296#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {296#false} is VALID [2022-04-15 01:03:56,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {296#false} is VALID [2022-04-15 01:03:56,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {296#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:56,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:03:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670013300] [2022-04-15 01:03:56,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670013300] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:03:56,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305071216] [2022-04-15 01:03:56,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:03:56,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:03:56,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:03:56,385 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:03:56,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 01:03:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:56,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 01:03:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:56,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:03:56,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} [99] 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) 10) (= (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] {295#true} is VALID [2022-04-15 01:03:56,669 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {300#(= main_~y~0 0)} is VALID [2022-04-15 01:03:56,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {300#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:56,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:56,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {301#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {331#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:03:56,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {331#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,671 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,672 INFO L272 TraceCheckUtils]: 14: Hoare triple {296#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {296#false} is VALID [2022-04-15 01:03:56,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {296#false} is VALID [2022-04-15 01:03:56,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {296#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:56,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:03:56,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {296#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {296#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {296#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {296#false} is VALID [2022-04-15 01:03:56,757 INFO L272 TraceCheckUtils]: 14: Hoare triple {296#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {296#false} is VALID [2022-04-15 01:03:56,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {296#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {296#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {296#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {296#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {383#(< 0 (mod main_~z~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 01:03:56,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {387#(< 0 (mod main_~y~0 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {383#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:03:56,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {387#(< 0 (mod main_~y~0 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {387#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:03:56,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {394#(< 0 (mod (+ main_~y~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {387#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:03:56,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {394#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 01:03:56,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} [99] 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) 10) (= (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] {295#true} is VALID [2022-04-15 01:03:56,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 01:03:56,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:56,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305071216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:03:56,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:03:56,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 01:03:56,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601380923] [2022-04-15 01:03:56,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:03:56,765 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 18 [2022-04-15 01:03:56,766 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:03:56,766 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-15 01:03:56,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:56,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 01:03:56,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:03:56,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 01:03:56,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 01:03:56,796 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-15 01:03:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:57,298 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2022-04-15 01:03:57,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 01:03:57,298 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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 18 [2022-04-15 01:03:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:03:57,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-15 01:03:57,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-15 01:03:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-15 01:03:57,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 98 transitions. [2022-04-15 01:03:57,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 98 transitions. [2022-04-15 01:03:57,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:57,403 INFO L225 Difference]: With dead ends: 61 [2022-04-15 01:03:57,403 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 01:03:57,404 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-04-15 01:03:57,405 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 01:03:57,405 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 45 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 01:03:57,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 01:03:57,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 42. [2022-04-15 01:03:57,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:03:57,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:57,442 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:57,443 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:57,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:57,449 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-04-15 01:03:57,449 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2022-04-15 01:03:57,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:57,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:57,450 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 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 52 states. [2022-04-15 01:03:57,450 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 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 52 states. [2022-04-15 01:03:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:57,455 INFO L93 Difference]: Finished difference Result 52 states and 75 transitions. [2022-04-15 01:03:57,455 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2022-04-15 01:03:57,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:57,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:57,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:03:57,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:03:57,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.5135135135135136) internal successors, (56), 37 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:57,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-04-15 01:03:57,459 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 18 [2022-04-15 01:03:57,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:03:57,459 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-04-15 01:03:57,459 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 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-15 01:03:57,459 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-04-15 01:03:57,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 01:03:57,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:03:57,460 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:03:57,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 01:03:57,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:03:57,676 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:03:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:03:57,676 INFO L85 PathProgramCache]: Analyzing trace with hash 854914035, now seen corresponding path program 1 times [2022-04-15 01:03:57,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:03:57,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962275523] [2022-04-15 01:03:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:03:57,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:03:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:57,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:03:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:57,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {675#true} is VALID [2022-04-15 01:03:57,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {675#true} {675#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} [97] 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-15 01:03:57,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {675#true} is VALID [2022-04-15 01:03:57,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {680#(= main_~y~0 0)} is VALID [2022-04-15 01:03:57,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {680#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:57,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:57,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {681#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {682#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:03:57,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:03:57,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:03:57,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {683#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-15 01:03:57,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-15 01:03:57,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-15 01:03:57,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {684#(and (<= (div main_~z~0 4294967296) 0) (<= 1 main_~z~0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,798 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {676#false} is VALID [2022-04-15 01:03:57,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {676#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {676#false} is VALID [2022-04-15 01:03:57,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {676#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:57,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:03:57,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962275523] [2022-04-15 01:03:57,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962275523] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:03:57,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847775122] [2022-04-15 01:03:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:03:57,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:03:57,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:03:57,815 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:03:57,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 01:03:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:57,847 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 01:03:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:57,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:03:57,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} [99] 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) 10) (= (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] {675#true} is VALID [2022-04-15 01:03:57,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:57,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {675#true} is VALID [2022-04-15 01:03:57,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:03:57,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:03:57,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:03:57,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:57,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:57,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:57,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:57,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,928 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {676#false} is VALID [2022-04-15 01:03:57,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {676#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {676#false} is VALID [2022-04-15 01:03:57,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {676#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,929 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:03:57,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:03:57,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {676#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,998 INFO L290 TraceCheckUtils]: 18: Hoare triple {676#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {676#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {676#false} is VALID [2022-04-15 01:03:57,998 INFO L272 TraceCheckUtils]: 16: Hoare triple {676#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {676#false} is VALID [2022-04-15 01:03:57,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {676#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {676#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {676#false} is VALID [2022-04-15 01:03:57,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:57,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:58,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:58,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {717#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:03:58,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:03:58,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:03:58,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {675#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {707#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:03:58,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {675#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {675#true} is VALID [2022-04-15 01:03:58,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {675#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:58,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {675#true} {675#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:58,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {675#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:58,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {675#true} [99] 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) 10) (= (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] {675#true} is VALID [2022-04-15 01:03:58,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {675#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {675#true} is VALID [2022-04-15 01:03:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:03:58,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847775122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:03:58,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:03:58,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-15 01:03:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390738447] [2022-04-15 01:03:58,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:03:58,005 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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 20 [2022-04-15 01:03:58,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:03:58,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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-15 01:03:58,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:58,028 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 01:03:58,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:03:58,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 01:03:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-04-15 01:03:58,029 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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-15 01:03:58,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:58,660 INFO L93 Difference]: Finished difference Result 95 states and 145 transitions. [2022-04-15 01:03:58,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 01:03:58,660 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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 20 [2022-04-15 01:03:58,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:03:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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-15 01:03:58,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2022-04-15 01:03:58,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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-15 01:03:58,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 94 transitions. [2022-04-15 01:03:58,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 94 transitions. [2022-04-15 01:03:58,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:03:58,735 INFO L225 Difference]: With dead ends: 95 [2022-04-15 01:03:58,735 INFO L226 Difference]: Without dead ends: 74 [2022-04-15 01:03:58,735 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-04-15 01:03:58,736 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 60 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 01:03:58,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 58 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 01:03:58,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-15 01:03:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 54. [2022-04-15 01:03:58,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:03:58,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:58,766 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:58,766 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:58,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:58,768 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-15 01:03:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-04-15 01:03:58,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:58,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:58,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 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 74 states. [2022-04-15 01:03:58,769 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 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 74 states. [2022-04-15 01:03:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:03:58,771 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2022-04-15 01:03:58,771 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 105 transitions. [2022-04-15 01:03:58,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:03:58,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:03:58,771 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:03:58,771 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:03:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:03:58,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2022-04-15 01:03:58,773 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 74 transitions. Word has length 20 [2022-04-15 01:03:58,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:03:58,773 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 74 transitions. [2022-04-15 01:03:58,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 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-15 01:03:58,773 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 74 transitions. [2022-04-15 01:03:58,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 01:03:58,774 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:03:58,774 INFO L499 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:03:58,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 01:03:58,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 01:03:58,988 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:03:58,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:03:58,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1519589393, now seen corresponding path program 2 times [2022-04-15 01:03:58,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:03:58,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488229437] [2022-04-15 01:03:58,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:03:58,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:03:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:59,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:03:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:59,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {1173#true} is VALID [2022-04-15 01:03:59,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,098 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1173#true} {1173#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:03:59,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {1184#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {1173#true} is VALID [2022-04-15 01:03:59,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1178#(= main_~y~0 0)} is VALID [2022-04-15 01:03:59,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:59,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:03:59,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:03:59,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:03:59,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:03:59,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {1183#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:03:59,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,116 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,116 INFO L272 TraceCheckUtils]: 17: Hoare triple {1174#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1174#false} is VALID [2022-04-15 01:03:59,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1174#false} is VALID [2022-04-15 01:03:59,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:59,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:03:59,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488229437] [2022-04-15 01:03:59,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488229437] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:03:59,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020732284] [2022-04-15 01:03:59,117 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:03:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:03:59,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:03:59,118 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:03:59,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 01:03:59,159 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:03:59,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:03:59,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 01:03:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:03:59,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:03:59,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [99] 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) 10) (= (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] {1173#true} is VALID [2022-04-15 01:03:59,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1178#(= main_~y~0 0)} is VALID [2022-04-15 01:03:59,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {1178#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:03:59,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {1179#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:03:59,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {1180#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:03:59,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:03:59,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:03:59,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {1182#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {1221#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:03:59,367 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,368 INFO L272 TraceCheckUtils]: 17: Hoare triple {1174#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1174#false} is VALID [2022-04-15 01:03:59,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1174#false} is VALID [2022-04-15 01:03:59,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:59,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:03:59,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1174#false} is VALID [2022-04-15 01:03:59,496 INFO L272 TraceCheckUtils]: 17: Hoare triple {1174#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {1174#false} is VALID [2022-04-15 01:03:59,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {1174#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {1273#(< 0 (mod main_~z~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {1174#false} is VALID [2022-04-15 01:03:59,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {1273#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:03:59,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {1277#(< 0 (mod main_~y~0 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:03:59,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {1284#(< 0 (mod (+ main_~y~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1277#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:03:59,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#(< 0 (mod (+ main_~y~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1284#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 01:03:59,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {1292#(< 0 (mod (+ main_~y~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1288#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 01:03:59,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {1296#(< 0 (mod (+ main_~y~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1292#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 01:03:59,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {1173#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {1296#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 01:03:59,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {1173#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1173#true} {1173#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {1173#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {1173#true} [99] 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) 10) (= (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] {1173#true} is VALID [2022-04-15 01:03:59,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {1173#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1173#true} is VALID [2022-04-15 01:03:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:03:59,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020732284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:03:59,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:03:59,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 01:03:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038465033] [2022-04-15 01:03:59,501 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:03:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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 21 [2022-04-15 01:03:59,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:03:59,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-15 01:03:59,522 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-15 01:03:59,523 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 01:03:59,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:03:59,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 01:03:59,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=184, Unknown=0, NotChecked=0, Total=240 [2022-04-15 01:03:59,524 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-15 01:04:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:01,345 INFO L93 Difference]: Finished difference Result 191 states and 311 transitions. [2022-04-15 01:04:01,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 01:04:01,345 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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 21 [2022-04-15 01:04:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:01,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-15 01:04:01,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2022-04-15 01:04:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-15 01:04:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 198 transitions. [2022-04-15 01:04:01,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 198 transitions. [2022-04-15 01:04:01,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:01,605 INFO L225 Difference]: With dead ends: 191 [2022-04-15 01:04:01,605 INFO L226 Difference]: Without dead ends: 176 [2022-04-15 01:04:01,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=416, Invalid=1144, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 01:04:01,607 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 290 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:01,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [290 Valid, 80 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 01:04:01,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-15 01:04:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 111. [2022-04-15 01:04:01,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:01,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:01,675 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:01,676 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:01,681 INFO L93 Difference]: Finished difference Result 176 states and 254 transitions. [2022-04-15 01:04:01,681 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2022-04-15 01:04:01,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:01,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:01,682 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 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 176 states. [2022-04-15 01:04:01,682 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 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 176 states. [2022-04-15 01:04:01,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:01,688 INFO L93 Difference]: Finished difference Result 176 states and 254 transitions. [2022-04-15 01:04:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 254 transitions. [2022-04-15 01:04:01,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:01,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:01,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:01,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.490566037735849) internal successors, (158), 106 states have internal predecessors, (158), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:01,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 162 transitions. [2022-04-15 01:04:01,692 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 162 transitions. Word has length 21 [2022-04-15 01:04:01,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:01,693 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 162 transitions. [2022-04-15 01:04:01,693 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 15 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-15 01:04:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 162 transitions. [2022-04-15 01:04:01,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 01:04:01,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:01,694 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:01,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 01:04:01,907 WARN L460 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-15 01:04:01,909 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:01,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1094145383, now seen corresponding path program 1 times [2022-04-15 01:04:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:01,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791414419] [2022-04-15 01:04:01,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:01,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:02,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:02,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {2115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {2102#true} is VALID [2022-04-15 01:04:02,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2102#true} {2102#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:02,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {2115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {2102#true} is VALID [2022-04-15 01:04:02,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 01:04:02,212 INFO L290 TraceCheckUtils]: 6: Hoare triple {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2108#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} is VALID [2022-04-15 01:04:02,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {2108#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) main_~y~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2109#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} is VALID [2022-04-15 01:04:02,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {2109#(and (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0)) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) main_~y~0) main_~n~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,224 INFO L290 TraceCheckUtils]: 12: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,228 INFO L290 TraceCheckUtils]: 13: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {2110#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) main_~z~0) main_~n~0) (<= (+ (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~z~0 (* (div (+ main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {2111#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) main_~z~0 1) main_~n~0) (<= (* (div main_~n~0 4294967296) 4294967296) (+ main_~z~0 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~z~0)) 4294967296) 4294967296))))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:02,240 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2113#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:04:02,241 INFO L290 TraceCheckUtils]: 20: Hoare triple {2113#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2114#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:04:02,241 INFO L290 TraceCheckUtils]: 21: Hoare triple {2114#(not (= __VERIFIER_assert_~cond 0))} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2103#false} is VALID [2022-04-15 01:04:02,241 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#false} is VALID [2022-04-15 01:04:02,241 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:04:02,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:02,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791414419] [2022-04-15 01:04:02,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791414419] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:02,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676209391] [2022-04-15 01:04:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:02,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:02,243 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:02,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 01:04:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:02,299 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 01:04:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:02,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:02,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} [99] 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) 10) (= (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] {2102#true} is VALID [2022-04-15 01:04:02,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:02,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 01:04:02,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {2107#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2137#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-15 01:04:02,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {2137#(and (= (+ main_~x~0 (* (- 1) main_~n~0) 1) 0) (= (+ (- 1) main_~y~0) 0) (< 0 (mod (+ main_~x~0 1) 4294967296)))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2141#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-15 01:04:02,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {2141#(and (= (+ main_~x~0 1) main_~n~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {2145#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} is VALID [2022-04-15 01:04:02,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {2145#(and (= (+ main_~x~0 1) main_~n~0) (= main_~z~0 main_~y~0) (= main_~y~0 1) (<= (mod main_~x~0 4294967296) 0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 01:04:02,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 01:04:02,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {2149#(and (= main_~y~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= main_~y~0 (+ main_~z~0 1)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 01:04:02,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 01:04:02,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {2156#(and (= (+ main_~y~0 1) 1) (= main_~z~0 (+ main_~y~0 1)) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 01:04:02,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 01:04:02,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-15 01:04:02,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} is VALID [2022-04-15 01:04:02,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {2170#(and (<= (mod (+ main_~n~0 4294967295) 4294967296) 0) (= (+ main_~z~0 1) 1))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 01:04:02,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} is VALID [2022-04-15 01:04:02,804 INFO L272 TraceCheckUtils]: 19: Hoare triple {2163#(and (= main_~z~0 1) (<= (mod (+ main_~n~0 4294967295) 4294967296) 0))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:04:02,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:04:02,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#(<= 1 __VERIFIER_assert_~cond)} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2103#false} is VALID [2022-04-15 01:04:02,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#false} is VALID [2022-04-15 01:04:02,805 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:04:02,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:03,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {2103#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2103#false} is VALID [2022-04-15 01:04:03,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {2187#(<= 1 __VERIFIER_assert_~cond)} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2103#false} is VALID [2022-04-15 01:04:03,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2187#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:04:03,336 INFO L272 TraceCheckUtils]: 19: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {2183#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:04:03,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,342 INFO L290 TraceCheckUtils]: 11: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {2112#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {2234#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {2209#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:04:03,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {2238#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {2234#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:04:03,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {2242#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2238#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-15 01:04:03,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {2246#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2242#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-15 01:04:03,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {2102#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {2246#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 01:04:03,349 INFO L272 TraceCheckUtils]: 4: Hoare triple {2102#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:03,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2102#true} {2102#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:03,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {2102#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:03,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {2102#true} [99] 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) 10) (= (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] {2102#true} is VALID [2022-04-15 01:04:03,349 INFO L272 TraceCheckUtils]: 0: Hoare triple {2102#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2102#true} is VALID [2022-04-15 01:04:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:04:03,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676209391] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:03,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:03,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 25 [2022-04-15 01:04:03,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108023520] [2022-04-15 01:04:03,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:03,351 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 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 23 [2022-04-15 01:04:03,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:03,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 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-15 01:04:03,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:03,407 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 01:04:03,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:03,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 01:04:03,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-04-15 01:04:03,408 INFO L87 Difference]: Start difference. First operand 111 states and 162 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 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-15 01:04:07,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:07,304 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2022-04-15 01:04:07,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 01:04:07,304 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 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 23 [2022-04-15 01:04:07,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:07,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 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-15 01:04:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 131 transitions. [2022-04-15 01:04:07,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 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-15 01:04:07,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 131 transitions. [2022-04-15 01:04:07,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 131 transitions. [2022-04-15 01:04:07,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:07,540 INFO L225 Difference]: With dead ends: 201 [2022-04-15 01:04:07,540 INFO L226 Difference]: Without dead ends: 190 [2022-04-15 01:04:07,542 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1256 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=682, Invalid=3478, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 01:04:07,542 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 112 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:07,543 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 82 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 01:04:07,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-04-15 01:04:07,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 124. [2022-04-15 01:04:07,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:07,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 190 states. Second operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:07,644 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:07,644 INFO L87 Difference]: Start difference. First operand 190 states. Second operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:07,649 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2022-04-15 01:04:07,649 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 280 transitions. [2022-04-15 01:04:07,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:07,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:07,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 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 190 states. [2022-04-15 01:04:07,651 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 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 190 states. [2022-04-15 01:04:07,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:07,660 INFO L93 Difference]: Finished difference Result 190 states and 280 transitions. [2022-04-15 01:04:07,660 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 280 transitions. [2022-04-15 01:04:07,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:07,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:07,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:07,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.5378151260504203) internal successors, (183), 119 states have internal predecessors, (183), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 187 transitions. [2022-04-15 01:04:07,663 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 187 transitions. Word has length 23 [2022-04-15 01:04:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:07,663 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 187 transitions. [2022-04-15 01:04:07,663 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 22 states have internal predecessors, (48), 3 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-15 01:04:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 187 transitions. [2022-04-15 01:04:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 01:04:07,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:07,664 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:07,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 01:04:07,881 WARN L460 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-15 01:04:07,881 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:07,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:07,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1613070417, now seen corresponding path program 2 times [2022-04-15 01:04:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:07,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109345513] [2022-04-15 01:04:07,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:07,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:07,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:07,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {3141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {3129#true} is VALID [2022-04-15 01:04:07,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:07,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3129#true} {3129#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:07,996 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:07,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {3141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {3129#true} is VALID [2022-04-15 01:04:07,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:07,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:07,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:07,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3134#(= main_~y~0 0)} is VALID [2022-04-15 01:04:07,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {3134#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:07,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {3135#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:07,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:07,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {3136#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {3137#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:04:08,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {3137#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {3138#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:04:08,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {3138#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {3139#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:04:08,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {3139#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {3139#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:04:08,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {3139#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {3138#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:04:08,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {3138#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-15 01:04:08,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-15 01:04:08,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-15 01:04:08,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {3140#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,003 INFO L272 TraceCheckUtils]: 19: Hoare triple {3130#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3130#false} is VALID [2022-04-15 01:04:08,003 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3130#false} is VALID [2022-04-15 01:04:08,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,004 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,004 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-15 01:04:08,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109345513] [2022-04-15 01:04:08,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109345513] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:08,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000666096] [2022-04-15 01:04:08,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:04:08,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:08,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:08,005 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:08,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 01:04:08,042 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:04:08,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:04:08,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 01:04:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:08,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:08,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} [99] 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) 10) (= (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] {3129#true} is VALID [2022-04-15 01:04:08,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3129#true} is VALID [2022-04-15 01:04:08,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:08,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:08,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:08,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:08,177 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:08,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,182 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,183 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,184 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,184 INFO L272 TraceCheckUtils]: 19: Hoare triple {3130#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3130#false} is VALID [2022-04-15 01:04:08,184 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3130#false} is VALID [2022-04-15 01:04:08,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:04:08,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:08,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {3130#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {3130#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {3130#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {3130#false} is VALID [2022-04-15 01:04:08,266 INFO L272 TraceCheckUtils]: 19: Hoare triple {3130#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {3130#false} is VALID [2022-04-15 01:04:08,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {3130#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {3130#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {3130#false} is VALID [2022-04-15 01:04:08,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {3180#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {3180#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:08,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:08,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:08,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:08,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3167#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:08,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3163#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:08,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {3129#true} is VALID [2022-04-15 01:04:08,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {3129#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3129#true} {3129#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} [99] 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) 10) (= (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] {3129#true} is VALID [2022-04-15 01:04:08,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {3129#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3129#true} is VALID [2022-04-15 01:04:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:04:08,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000666096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:08,275 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:08,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2022-04-15 01:04:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227931544] [2022-04-15 01:04:08,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:08,276 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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 23 [2022-04-15 01:04:08,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:08,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-15 01:04:08,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:08,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 01:04:08,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:08,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 01:04:08,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:04:08,302 INFO L87 Difference]: Start difference. First operand 124 states and 187 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-15 01:04:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:10,237 INFO L93 Difference]: Finished difference Result 308 states and 469 transitions. [2022-04-15 01:04:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 01:04:10,238 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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 23 [2022-04-15 01:04:10,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-15 01:04:10,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 159 transitions. [2022-04-15 01:04:10,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-15 01:04:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 159 transitions. [2022-04-15 01:04:10,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 159 transitions. [2022-04-15 01:04:10,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:10,409 INFO L225 Difference]: With dead ends: 308 [2022-04-15 01:04:10,409 INFO L226 Difference]: Without dead ends: 267 [2022-04-15 01:04:10,409 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=1818, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 01:04:10,410 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 145 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:10,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 67 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 01:04:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-04-15 01:04:10,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 155. [2022-04-15 01:04:10,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:10,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:10,533 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:10,533 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:10,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:10,540 INFO L93 Difference]: Finished difference Result 267 states and 382 transitions. [2022-04-15 01:04:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 382 transitions. [2022-04-15 01:04:10,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:10,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:10,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 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 267 states. [2022-04-15 01:04:10,541 INFO L87 Difference]: Start difference. First operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 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 267 states. [2022-04-15 01:04:10,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:10,547 INFO L93 Difference]: Finished difference Result 267 states and 382 transitions. [2022-04-15 01:04:10,547 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 382 transitions. [2022-04-15 01:04:10,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:10,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:10,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:10,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:10,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 150 states have (on average 1.5066666666666666) internal successors, (226), 150 states have internal predecessors, (226), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 230 transitions. [2022-04-15 01:04:10,551 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 230 transitions. Word has length 23 [2022-04-15 01:04:10,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:10,551 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 230 transitions. [2022-04-15 01:04:10,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 12 states have internal predecessors, (32), 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-15 01:04:10,551 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 230 transitions. [2022-04-15 01:04:10,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 01:04:10,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:10,552 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:10,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 01:04:10,763 WARN L460 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-15 01:04:10,764 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:10,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:10,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1137871535, now seen corresponding path program 2 times [2022-04-15 01:04:10,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:10,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791960661] [2022-04-15 01:04:10,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:10,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:10,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:10,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {4446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {4439#true} is VALID [2022-04-15 01:04:10,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {4439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:10,828 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4439#true} {4439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:10,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {4439#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:10,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {4446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {4439#true} is VALID [2022-04-15 01:04:10,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {4439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:10,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4439#true} {4439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:10,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {4439#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:10,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {4439#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {4439#true} is VALID [2022-04-15 01:04:10,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4439#true} is VALID [2022-04-15 01:04:10,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:10,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:10,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:10,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:10,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:10,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:10,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {4440#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {4440#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L272 TraceCheckUtils]: 21: Hoare triple {4440#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {4440#false} is VALID [2022-04-15 01:04:10,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4440#false} is VALID [2022-04-15 01:04:10,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:10,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:10,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:04:10,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:10,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791960661] [2022-04-15 01:04:10,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791960661] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:10,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735892251] [2022-04-15 01:04:10,833 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:04:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:10,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:10,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:10,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 01:04:10,865 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:04:10,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:04:10,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 01:04:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:10,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:11,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {4439#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {4439#true} [99] 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) 10) (= (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] {4439#true} is VALID [2022-04-15 01:04:11,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {4439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4439#true} {4439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {4439#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {4439#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {4439#true} is VALID [2022-04-15 01:04:11,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4439#true} is VALID [2022-04-15 01:04:11,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:11,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:11,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:11,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {4440#false} is VALID [2022-04-15 01:04:11,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {4440#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {4440#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L272 TraceCheckUtils]: 21: Hoare triple {4440#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:04:11,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:11,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L272 TraceCheckUtils]: 21: Hoare triple {4440#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {4440#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {4440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {4440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 17: Hoare triple {4440#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {4440#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {4440#false} is VALID [2022-04-15 01:04:11,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {4440#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {4440#false} is VALID [2022-04-15 01:04:11,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {4440#false} is VALID [2022-04-15 01:04:11,147 INFO L290 TraceCheckUtils]: 13: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:11,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,149 INFO L290 TraceCheckUtils]: 9: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {4445#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:04:11,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:11,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {4439#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {4444#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:04:11,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {4439#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4439#true} is VALID [2022-04-15 01:04:11,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {4439#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {4439#true} is VALID [2022-04-15 01:04:11,149 INFO L272 TraceCheckUtils]: 4: Hoare triple {4439#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4439#true} {4439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {4439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {4439#true} [99] 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) 10) (= (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] {4439#true} is VALID [2022-04-15 01:04:11,150 INFO L272 TraceCheckUtils]: 0: Hoare triple {4439#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4439#true} is VALID [2022-04-15 01:04:11,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:04:11,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735892251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:11,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:11,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 01:04:11,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544405552] [2022-04-15 01:04:11,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:11,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 25 [2022-04-15 01:04:11,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:11,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-15 01:04:11,165 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-15 01:04:11,165 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 01:04:11,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:11,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 01:04:11,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 01:04:11,166 INFO L87 Difference]: Start difference. First operand 155 states and 230 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-15 01:04:11,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:11,452 INFO L93 Difference]: Finished difference Result 245 states and 369 transitions. [2022-04-15 01:04:11,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 01:04:11,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 25 [2022-04-15 01:04:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-15 01:04:11,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-15 01:04:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-15 01:04:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2022-04-15 01:04:11,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2022-04-15 01:04:11,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:11,494 INFO L225 Difference]: With dead ends: 245 [2022-04-15 01:04:11,494 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 01:04:11,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-15 01:04:11,495 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 32 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:11,495 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 01:04:11,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 01:04:11,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 152. [2022-04-15 01:04:11,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:11,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:11,604 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:11,605 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:11,608 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2022-04-15 01:04:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 267 transitions. [2022-04-15 01:04:11,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:11,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:11,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 states have internal predecessors, (217), 3 states have call successors, (3), 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 182 states. [2022-04-15 01:04:11,609 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 states have internal predecessors, (217), 3 states have call successors, (3), 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 182 states. [2022-04-15 01:04:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:11,612 INFO L93 Difference]: Finished difference Result 182 states and 267 transitions. [2022-04-15 01:04:11,613 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 267 transitions. [2022-04-15 01:04:11,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:11,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:11,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:11,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.4761904761904763) internal successors, (217), 147 states have internal predecessors, (217), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 221 transitions. [2022-04-15 01:04:11,616 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 221 transitions. Word has length 25 [2022-04-15 01:04:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:11,616 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 221 transitions. [2022-04-15 01:04:11,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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-15 01:04:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 221 transitions. [2022-04-15 01:04:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 01:04:11,617 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:11,617 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:11,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 01:04:11,831 WARN L460 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-15 01:04:11,832 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:11,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1021131411, now seen corresponding path program 1 times [2022-04-15 01:04:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:11,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931264686] [2022-04-15 01:04:11,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:11,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:11,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {5450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {5439#true} is VALID [2022-04-15 01:04:11,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {5439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:11,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5439#true} {5439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:11,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {5439#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:11,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {5450#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {5439#true} is VALID [2022-04-15 01:04:11,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {5439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:11,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:11,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {5439#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:11,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {5439#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {5444#(= main_~y~0 0)} is VALID [2022-04-15 01:04:11,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {5444#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:11,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:11,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:11,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:11,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {5448#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:04:11,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {5448#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {5449#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} is VALID [2022-04-15 01:04:11,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {5449#(and (<= (div main_~z~0 4294967296) 0) (<= 2 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {5440#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {5440#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {5440#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {5440#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 17: Hoare triple {5440#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {5440#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {5440#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 20: Hoare triple {5440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {5440#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L272 TraceCheckUtils]: 22: Hoare triple {5440#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {5440#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {5440#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {5440#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 01:04:11,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931264686] [2022-04-15 01:04:11,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931264686] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:11,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540481347] [2022-04-15 01:04:11,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:11,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:11,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:11,935 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:11,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 01:04:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:11,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 01:04:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:11,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:12,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {5439#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {5439#true} [99] 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) 10) (= (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] {5439#true} is VALID [2022-04-15 01:04:12,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {5439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {5439#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {5439#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {5444#(= main_~y~0 0)} is VALID [2022-04-15 01:04:12,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {5444#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:12,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {5445#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:12,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {5446#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:12,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:12,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {5447#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {5484#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:12,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {5484#(and (= main_~z~0 main_~y~0) (<= main_~y~0 3) (<= 3 main_~y~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {5488#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {5488#(and (<= main_~y~0 3) (<= 3 main_~y~0) (= main_~y~0 (+ main_~z~0 1)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {5440#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {5440#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {5440#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {5440#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {5440#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {5440#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {5440#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {5440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {5440#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L272 TraceCheckUtils]: 22: Hoare triple {5440#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {5440#false} is VALID [2022-04-15 01:04:12,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {5440#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5440#false} is VALID [2022-04-15 01:04:12,079 INFO L290 TraceCheckUtils]: 24: Hoare triple {5440#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {5440#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 01:04:12,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {5440#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {5440#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {5440#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L272 TraceCheckUtils]: 22: Hoare triple {5440#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {5440#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {5440#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {5440#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 18: Hoare triple {5440#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 17: Hoare triple {5440#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 16: Hoare triple {5440#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {5440#false} is VALID [2022-04-15 01:04:12,193 INFO L290 TraceCheckUtils]: 15: Hoare triple {5440#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:12,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {5564#(not (< 0 (mod main_~y~0 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5440#false} is VALID [2022-04-15 01:04:12,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {5568#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {5564#(not (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 01:04:12,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {5572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {5568#(not (< 0 (mod (+ main_~y~0 4294967295) 4294967296)))} is VALID [2022-04-15 01:04:12,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {5576#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {5572#(or (< 0 (mod main_~z~0 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {5439#true} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {5576#(or (< 0 (mod (+ main_~z~0 4294967295) 4294967296)) (not (< 0 (mod (+ main_~y~0 4294967295) 4294967296))))} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {5439#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {5439#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {5439#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {5439#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {5439#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L272 TraceCheckUtils]: 4: Hoare triple {5439#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5439#true} {5439#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {5439#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {5439#true} [99] 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) 10) (= (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] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {5439#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5439#true} is VALID [2022-04-15 01:04:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 01:04:12,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540481347] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:12,197 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:12,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 6] total 15 [2022-04-15 01:04:12,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648649298] [2022-04-15 01:04:12,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:12,199 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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 26 [2022-04-15 01:04:12,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:12,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-15 01:04:12,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:12,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 01:04:12,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 01:04:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-04-15 01:04:12,223 INFO L87 Difference]: Start difference. First operand 152 states and 221 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-15 01:04:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:13,299 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2022-04-15 01:04:13,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 01:04:13,299 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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 26 [2022-04-15 01:04:13,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:13,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-15 01:04:13,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-15 01:04:13,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-15 01:04:13,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 114 transitions. [2022-04-15 01:04:13,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 114 transitions. [2022-04-15 01:04:13,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:13,395 INFO L225 Difference]: With dead ends: 232 [2022-04-15 01:04:13,395 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 01:04:13,398 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=874, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 01:04:13,399 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 91 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:13,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 65 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 01:04:13,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 01:04:13,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2022-04-15 01:04:13,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:13,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:13,512 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:13,512 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:13,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:13,515 INFO L93 Difference]: Finished difference Result 182 states and 261 transitions. [2022-04-15 01:04:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2022-04-15 01:04:13,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:13,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:13,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 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 182 states. [2022-04-15 01:04:13,516 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 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 182 states. [2022-04-15 01:04:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:13,518 INFO L93 Difference]: Finished difference Result 182 states and 261 transitions. [2022-04-15 01:04:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 261 transitions. [2022-04-15 01:04:13,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:13,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:13,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:13,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.4825174825174825) internal successors, (212), 143 states have internal predecessors, (212), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2022-04-15 01:04:13,520 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 26 [2022-04-15 01:04:13,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:13,521 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2022-04-15 01:04:13,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 14 states have internal predecessors, (32), 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-15 01:04:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2022-04-15 01:04:13,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 01:04:13,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:13,521 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:13,538 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-15 01:04:13,734 WARN L460 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-15 01:04:13,734 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:13,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1900157837, now seen corresponding path program 3 times [2022-04-15 01:04:13,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:13,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023320640] [2022-04-15 01:04:13,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:13,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:13,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:13,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {6487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {6473#true} is VALID [2022-04-15 01:04:13,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {6473#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:13,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6473#true} {6473#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:13,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {6473#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:13,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {6487#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {6473#true} is VALID [2022-04-15 01:04:13,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {6473#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:13,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:13,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {6473#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:13,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {6473#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {6478#(= main_~y~0 0)} is VALID [2022-04-15 01:04:13,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {6478#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:13,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {6479#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:13,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {6480#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:13,895 INFO L290 TraceCheckUtils]: 9: Hoare triple {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:13,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {6481#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {6482#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:04:13,896 INFO L290 TraceCheckUtils]: 11: Hoare triple {6482#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6483#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:04:13,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {6483#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6484#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:04:13,897 INFO L290 TraceCheckUtils]: 13: Hoare triple {6484#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6485#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:04:13,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {6485#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {6485#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:04:13,898 INFO L290 TraceCheckUtils]: 15: Hoare triple {6485#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6484#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:04:13,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {6484#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6483#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:04:13,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {6483#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:04:13,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:04:13,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:04:13,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {6486#(and (<= 3 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:13,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {6474#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:13,900 INFO L272 TraceCheckUtils]: 22: Hoare triple {6474#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {6474#false} is VALID [2022-04-15 01:04:13,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {6474#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6474#false} is VALID [2022-04-15 01:04:13,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {6474#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:13,900 INFO L290 TraceCheckUtils]: 25: Hoare triple {6474#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:04:13,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:13,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023320640] [2022-04-15 01:04:13,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023320640] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:13,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857402101] [2022-04-15 01:04:13,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 01:04:13,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:13,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:13,901 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:13,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 01:04:13,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-15 01:04:13,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:04:13,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 01:04:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:13,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:14,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {6473#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {6473#true} [99] 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) 10) (= (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] {6473#true} is VALID [2022-04-15 01:04:14,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {6473#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {6473#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {6473#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {6473#true} is VALID [2022-04-15 01:04:14,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {6473#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:14,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:14,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:04:14,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:04:14,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:04:14,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:14,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:14,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {6474#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {6474#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,064 INFO L272 TraceCheckUtils]: 22: Hoare triple {6474#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {6474#false} is VALID [2022-04-15 01:04:14,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {6474#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6474#false} is VALID [2022-04-15 01:04:14,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {6474#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {6474#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,065 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:04:14,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:14,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {6474#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {6474#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,146 INFO L290 TraceCheckUtils]: 23: Hoare triple {6474#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {6474#false} is VALID [2022-04-15 01:04:14,146 INFO L272 TraceCheckUtils]: 22: Hoare triple {6474#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {6474#false} is VALID [2022-04-15 01:04:14,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {6474#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {6474#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {6474#false} is VALID [2022-04-15 01:04:14,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {6533#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6533#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:04:14,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:14,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:14,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:04:14,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:04:14,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6517#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:04:14,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6513#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:04:14,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {6473#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6509#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:04:14,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {6473#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {6473#true} is VALID [2022-04-15 01:04:14,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {6473#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6473#true} {6473#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {6473#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {6473#true} [99] 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) 10) (= (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] {6473#true} is VALID [2022-04-15 01:04:14,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {6473#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6473#true} is VALID [2022-04-15 01:04:14,153 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:04:14,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857402101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:14,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:14,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 16 [2022-04-15 01:04:14,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528628494] [2022-04-15 01:04:14,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:14,154 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 26 [2022-04-15 01:04:14,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:14,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-15 01:04:14,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:14,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 01:04:14,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:14,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 01:04:14,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-04-15 01:04:14,180 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-15 01:04:18,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:18,055 INFO L93 Difference]: Finished difference Result 360 states and 539 transitions. [2022-04-15 01:04:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 01:04:18,055 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 26 [2022-04-15 01:04:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:18,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-15 01:04:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 223 transitions. [2022-04-15 01:04:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-15 01:04:18,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 223 transitions. [2022-04-15 01:04:18,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 223 transitions. [2022-04-15 01:04:18,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 223 edges. 223 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:18,310 INFO L225 Difference]: With dead ends: 360 [2022-04-15 01:04:18,310 INFO L226 Difference]: Without dead ends: 323 [2022-04-15 01:04:18,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1678 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=681, Invalid=4869, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 01:04:18,311 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 186 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 904 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:18,311 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [186 Valid, 95 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 904 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 01:04:18,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-04-15 01:04:18,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 172. [2022-04-15 01:04:18,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:18,434 INFO L82 GeneralOperation]: Start isEquivalent. First operand 323 states. Second operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:18,435 INFO L74 IsIncluded]: Start isIncluded. First operand 323 states. Second operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:18,435 INFO L87 Difference]: Start difference. First operand 323 states. Second operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:18,440 INFO L93 Difference]: Finished difference Result 323 states and 453 transitions. [2022-04-15 01:04:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 453 transitions. [2022-04-15 01:04:18,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:18,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:18,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 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 323 states. [2022-04-15 01:04:18,441 INFO L87 Difference]: Start difference. First operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 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 323 states. [2022-04-15 01:04:18,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:18,446 INFO L93 Difference]: Finished difference Result 323 states and 453 transitions. [2022-04-15 01:04:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 453 transitions. [2022-04-15 01:04:18,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:18,446 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:18,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:18,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 167 states have (on average 1.4850299401197604) internal successors, (248), 167 states have internal predecessors, (248), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2022-04-15 01:04:18,449 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 26 [2022-04-15 01:04:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:18,449 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2022-04-15 01:04:18,449 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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-15 01:04:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2022-04-15 01:04:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 01:04:18,450 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:18,450 INFO L499 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:18,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 01:04:18,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 01:04:18,662 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:18,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1017178931, now seen corresponding path program 2 times [2022-04-15 01:04:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:18,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474908355] [2022-04-15 01:04:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:18,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:18,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {8057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {8044#true} is VALID [2022-04-15 01:04:18,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {8044#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:18,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8044#true} {8044#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:18,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {8044#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:18,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {8057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {8044#true} is VALID [2022-04-15 01:04:18,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {8044#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:18,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8044#true} {8044#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:18,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {8044#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:18,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {8044#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {8049#(= main_~y~0 0)} is VALID [2022-04-15 01:04:18,815 INFO L290 TraceCheckUtils]: 6: Hoare triple {8049#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:18,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:18,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:18,816 INFO L290 TraceCheckUtils]: 9: Hoare triple {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8053#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:04:18,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {8053#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:04:18,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:04:18,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {8055#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 01:04:18,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {8055#(and (<= main_~z~0 5) (<= 5 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {8056#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:04:18,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {8056#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:18,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {8045#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {8045#false} is VALID [2022-04-15 01:04:18,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:18,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {8045#false} is VALID [2022-04-15 01:04:18,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {8045#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:18,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {8045#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:18,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {8045#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {8045#false} is VALID [2022-04-15 01:04:18,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {8045#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:18,819 INFO L272 TraceCheckUtils]: 22: Hoare triple {8045#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {8045#false} is VALID [2022-04-15 01:04:18,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {8045#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8045#false} is VALID [2022-04-15 01:04:18,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {8045#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:18,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {8045#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:04:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:18,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474908355] [2022-04-15 01:04:18,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474908355] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:18,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [999024596] [2022-04-15 01:04:18,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:04:18,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:18,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:18,820 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:18,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 01:04:18,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:04:18,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:04:18,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 01:04:18,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:18,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:19,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {8044#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {8044#true} [99] 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) 10) (= (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] {8044#true} is VALID [2022-04-15 01:04:19,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {8044#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8044#true} {8044#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {8044#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {8044#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {8049#(= main_~y~0 0)} is VALID [2022-04-15 01:04:19,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {8049#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:19,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {8050#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:19,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {8051#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:19,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {8052#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8053#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:04:19,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {8053#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:04:19,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:04:19,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {8054#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {8055#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 01:04:19,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {8055#(and (<= main_~z~0 5) (<= 5 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {8100#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:04:19,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {8100#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {8045#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {8045#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {8045#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {8045#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {8045#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L272 TraceCheckUtils]: 22: Hoare triple {8045#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {8045#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {8045#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {8045#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,085 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:04:19,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:19,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {8045#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {8045#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 23: Hoare triple {8045#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L272 TraceCheckUtils]: 22: Hoare triple {8045#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 21: Hoare triple {8045#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {8045#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {8045#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {8045#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {8045#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {8045#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {8045#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {8045#false} is VALID [2022-04-15 01:04:19,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {8170#(< 0 (mod main_~z~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {8045#false} is VALID [2022-04-15 01:04:19,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {8174#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {8170#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:04:19,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {8174#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 01:04:19,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 01:04:19,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {8185#(< 0 (mod main_~y~0 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8178#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 01:04:19,260 INFO L290 TraceCheckUtils]: 9: Hoare triple {8189#(< 0 (mod (+ main_~y~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8185#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:04:19,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {8193#(< 0 (mod (+ main_~y~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8189#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 01:04:19,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {8197#(< 0 (mod (+ main_~y~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8193#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 01:04:19,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {8201#(< 0 (mod (+ main_~y~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8197#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 01:04:19,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {8044#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {8201#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 01:04:19,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {8044#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8044#true} {8044#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {8044#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {8044#true} [99] 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) 10) (= (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] {8044#true} is VALID [2022-04-15 01:04:19,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {8044#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8044#true} is VALID [2022-04-15 01:04:19,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:04:19,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [999024596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:19,263 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:19,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 01:04:19,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039190683] [2022-04-15 01:04:19,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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 26 [2022-04-15 01:04:19,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:19,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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-15 01:04:19,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:19,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 01:04:19,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:19,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 01:04:19,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2022-04-15 01:04:19,288 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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-15 01:04:24,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:24,599 INFO L93 Difference]: Finished difference Result 414 states and 648 transitions. [2022-04-15 01:04:24,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 01:04:24,599 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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 26 [2022-04-15 01:04:24,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:24,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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-15 01:04:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 305 transitions. [2022-04-15 01:04:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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-15 01:04:24,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 305 transitions. [2022-04-15 01:04:24,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 305 transitions. [2022-04-15 01:04:25,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:25,101 INFO L225 Difference]: With dead ends: 414 [2022-04-15 01:04:25,101 INFO L226 Difference]: Without dead ends: 348 [2022-04-15 01:04:25,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2196 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1524, Invalid=4956, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 01:04:25,103 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 436 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:25,103 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 93 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 01:04:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-04-15 01:04:25,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 213. [2022-04-15 01:04:25,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:25,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 348 states. Second operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:25,277 INFO L74 IsIncluded]: Start isIncluded. First operand 348 states. Second operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:25,277 INFO L87 Difference]: Start difference. First operand 348 states. Second operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:25,282 INFO L93 Difference]: Finished difference Result 348 states and 499 transitions. [2022-04-15 01:04:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 499 transitions. [2022-04-15 01:04:25,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:25,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:25,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 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 348 states. [2022-04-15 01:04:25,283 INFO L87 Difference]: Start difference. First operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 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 348 states. [2022-04-15 01:04:25,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:25,292 INFO L93 Difference]: Finished difference Result 348 states and 499 transitions. [2022-04-15 01:04:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 499 transitions. [2022-04-15 01:04:25,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:25,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:25,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:25,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 208 states have (on average 1.4663461538461537) internal successors, (305), 208 states have internal predecessors, (305), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2022-04-15 01:04:25,296 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 26 [2022-04-15 01:04:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:25,296 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2022-04-15 01:04:25,297 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 19 states have internal predecessors, (35), 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-15 01:04:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2022-04-15 01:04:25,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 01:04:25,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:25,298 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:25,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 01:04:25,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:25,509 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:25,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1254784593, now seen corresponding path program 3 times [2022-04-15 01:04:25,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:25,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220046580] [2022-04-15 01:04:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:25,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:25,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {9802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {9794#true} is VALID [2022-04-15 01:04:25,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {9794#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9794#true} {9794#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {9794#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:25,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {9802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {9794#true} is VALID [2022-04-15 01:04:25,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {9794#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9794#true} {9794#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {9794#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {9794#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {9794#true} is VALID [2022-04-15 01:04:25,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {9794#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9794#true} is VALID [2022-04-15 01:04:25,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {9794#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:25,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:25,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:25,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,581 INFO L290 TraceCheckUtils]: 17: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,581 INFO L290 TraceCheckUtils]: 18: Hoare triple {9795#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {9795#false} is VALID [2022-04-15 01:04:25,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {9795#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {9795#false} is VALID [2022-04-15 01:04:25,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {9795#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {9795#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {9795#false} is VALID [2022-04-15 01:04:25,582 INFO L290 TraceCheckUtils]: 22: Hoare triple {9795#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,582 INFO L272 TraceCheckUtils]: 23: Hoare triple {9795#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {9795#false} is VALID [2022-04-15 01:04:25,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {9795#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9795#false} is VALID [2022-04-15 01:04:25,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {9795#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {9795#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,582 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 01:04:25,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:25,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220046580] [2022-04-15 01:04:25,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220046580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:25,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721333738] [2022-04-15 01:04:25,582 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 01:04:25,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:25,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:25,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:25,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 01:04:25,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-15 01:04:25,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:04:25,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 01:04:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:25,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:25,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {9794#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {9794#true} [99] 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) 10) (= (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] {9794#true} is VALID [2022-04-15 01:04:25,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {9794#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9794#true} {9794#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {9794#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:25,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {9794#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {9794#true} is VALID [2022-04-15 01:04:25,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {9794#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9794#true} is VALID [2022-04-15 01:04:25,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {9794#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:25,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:25,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:25,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,805 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {9795#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {9795#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 20: Hoare triple {9795#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {9795#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {9795#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L272 TraceCheckUtils]: 23: Hoare triple {9795#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {9795#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {9795#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {9795#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 01:04:25,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {9795#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {9795#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {9795#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L272 TraceCheckUtils]: 23: Hoare triple {9795#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 22: Hoare triple {9795#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {9795#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {9795#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {9795#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {9795#false} is VALID [2022-04-15 01:04:26,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {9795#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {9795#false} is VALID [2022-04-15 01:04:26,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {9795#false} is VALID [2022-04-15 01:04:26,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:26,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:26,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:26,023 INFO L290 TraceCheckUtils]: 13: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:26,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:26,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {9801#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:26,024 INFO L290 TraceCheckUtils]: 10: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {9800#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:04:26,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:26,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:26,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {9794#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9799#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:04:26,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {9794#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9794#true} is VALID [2022-04-15 01:04:26,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {9794#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {9794#true} is VALID [2022-04-15 01:04:26,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {9794#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:26,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9794#true} {9794#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:26,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {9794#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:26,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {9794#true} [99] 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) 10) (= (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] {9794#true} is VALID [2022-04-15 01:04:26,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {9794#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9794#true} is VALID [2022-04-15 01:04:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 01:04:26,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721333738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:26,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:26,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-15 01:04:26,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011944316] [2022-04-15 01:04:26,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 27 [2022-04-15 01:04:26,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:26,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-15 01:04:26,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:26,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:04:26,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:26,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:04:26,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 01:04:26,045 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-15 01:04:26,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:26,556 INFO L93 Difference]: Finished difference Result 316 states and 451 transitions. [2022-04-15 01:04:26,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 01:04:26,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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 27 [2022-04-15 01:04:26,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:04:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-15 01:04:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 01:04:26,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-15 01:04:26,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 66 transitions. [2022-04-15 01:04:26,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 66 transitions. [2022-04-15 01:04:26,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:26,617 INFO L225 Difference]: With dead ends: 316 [2022-04-15 01:04:26,617 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 01:04:26,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 01:04:26,618 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 01:04:26,618 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 47 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 01:04:26,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 01:04:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 222. [2022-04-15 01:04:26,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:04:26,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:26,829 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:26,830 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:26,834 INFO L93 Difference]: Finished difference Result 303 states and 434 transitions. [2022-04-15 01:04:26,834 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 434 transitions. [2022-04-15 01:04:26,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:26,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:26,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 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 303 states. [2022-04-15 01:04:26,835 INFO L87 Difference]: Start difference. First operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 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 303 states. [2022-04-15 01:04:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:04:26,839 INFO L93 Difference]: Finished difference Result 303 states and 434 transitions. [2022-04-15 01:04:26,839 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 434 transitions. [2022-04-15 01:04:26,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:04:26,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:04:26,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:04:26,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:04:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 217 states have (on average 1.456221198156682) internal successors, (316), 217 states have internal predecessors, (316), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:04:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 320 transitions. [2022-04-15 01:04:26,842 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 320 transitions. Word has length 27 [2022-04-15 01:04:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:04:26,842 INFO L478 AbstractCegarLoop]: Abstraction has 222 states and 320 transitions. [2022-04-15 01:04:26,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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-15 01:04:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 320 transitions. [2022-04-15 01:04:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 01:04:26,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:04:26,843 INFO L499 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:04:26,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 01:04:27,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 01:04:27,060 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:04:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:04:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1293276530, now seen corresponding path program 3 times [2022-04-15 01:04:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:04:27,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999066446] [2022-04-15 01:04:27,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:04:27,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:04:27,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:27,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:04:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:27,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {11244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {11226#true} is VALID [2022-04-15 01:04:27,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {11226#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11226#true} {11226#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,240 INFO L272 TraceCheckUtils]: 0: Hoare triple {11226#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:04:27,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {11244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {11226#true} is VALID [2022-04-15 01:04:27,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {11226#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11226#true} {11226#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {11226#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {11226#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {11231#(= main_~y~0 0)} is VALID [2022-04-15 01:04:27,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {11231#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:27,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:27,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:27,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11235#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:04:27,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {11235#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11236#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:04:27,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {11236#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11237#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:04:27,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {11237#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11238#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:04:27,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {11238#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11239#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-15 01:04:27,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {11239#(and (<= main_~y~0 8) (<= 8 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11240#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-15 01:04:27,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {11240#(and (<= 9 main_~y~0) (<= main_~y~0 9))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11241#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-15 01:04:27,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {11241#(and (<= main_~y~0 10) (<= 10 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:04:27,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:04:27,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {11243#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-15 01:04:27,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {11243#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {11227#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {11227#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {11227#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {11227#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,248 INFO L272 TraceCheckUtils]: 24: Hoare triple {11227#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {11227#false} is VALID [2022-04-15 01:04:27,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {11227#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11227#false} is VALID [2022-04-15 01:04:27,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {11227#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {11227#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,248 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:04:27,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:04:27,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999066446] [2022-04-15 01:04:27,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999066446] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:04:27,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147445872] [2022-04-15 01:04:27,248 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 01:04:27,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:04:27,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:04:27,249 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:04:27,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 01:04:27,329 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-04-15 01:04:27,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:04:27,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 01:04:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:04:27,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:04:27,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {11226#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {11226#true} [99] 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) 10) (= (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] {11226#true} is VALID [2022-04-15 01:04:27,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {11226#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11226#true} {11226#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {11226#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {11226#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {11231#(= main_~y~0 0)} is VALID [2022-04-15 01:04:27,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {11231#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:04:27,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {11232#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:04:27,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {11233#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:04:27,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {11234#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11235#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:04:27,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {11235#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11236#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:04:27,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {11236#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11237#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:04:27,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {11237#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11238#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:04:27,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {11238#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11239#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-15 01:04:27,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {11239#(and (<= main_~y~0 8) (<= 8 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11240#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-15 01:04:27,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {11240#(and (<= 9 main_~y~0) (<= main_~y~0 9))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11241#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-15 01:04:27,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {11241#(and (<= main_~y~0 10) (<= 10 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:04:27,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:04:27,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {11242#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {11302#(and (<= main_~z~0 11) (<= 11 main_~z~0))} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {11302#(and (<= main_~z~0 11) (<= 11 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {11227#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 21: Hoare triple {11227#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 22: Hoare triple {11227#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {11227#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L272 TraceCheckUtils]: 24: Hoare triple {11227#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {11227#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {11227#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {11227#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:04:27,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:04:27,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {11227#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {11227#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 25: Hoare triple {11227#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L272 TraceCheckUtils]: 24: Hoare triple {11227#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {11227#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {11227#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {11227#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {11227#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {11354#(< 0 (mod main_~z~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {11227#false} is VALID [2022-04-15 01:04:27,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {11358#(< 0 (mod main_~y~0 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {11354#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:04:27,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {11358#(< 0 (mod main_~y~0 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {11358#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:04:27,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {11365#(< 0 (mod (+ main_~y~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11358#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:04:27,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {11369#(< 0 (mod (+ main_~y~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11365#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 01:04:27,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {11373#(< 0 (mod (+ main_~y~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11369#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 01:04:27,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {11377#(< 0 (mod (+ main_~y~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11373#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 01:04:27,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {11381#(< 0 (mod (+ 5 main_~y~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11377#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 01:04:27,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {11385#(< 0 (mod (+ main_~y~0 6) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11381#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-15 01:04:27,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {11389#(< 0 (mod (+ 7 main_~y~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11385#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-15 01:04:27,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {11393#(< 0 (mod (+ main_~y~0 8) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11389#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-15 01:04:27,934 INFO L290 TraceCheckUtils]: 8: Hoare triple {11397#(< 0 (mod (+ main_~y~0 9) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11393#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-15 01:04:27,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {11401#(< 0 (mod (+ main_~y~0 10) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11397#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-15 01:04:27,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {11405#(< 0 (mod (+ main_~y~0 11) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11401#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-15 01:04:27,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {11226#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {11405#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-15 01:04:27,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {11226#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11226#true} {11226#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {11226#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {11226#true} [99] 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) 10) (= (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] {11226#true} is VALID [2022-04-15 01:04:27,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {11226#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11226#true} is VALID [2022-04-15 01:04:27,936 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:04:27,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147445872] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:04:27,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:04:27,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 01:04:27,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025038201] [2022-04-15 01:04:27,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:04:27,942 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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 28 [2022-04-15 01:04:27,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:04:27,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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-15 01:04:27,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:04:27,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 01:04:27,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:04:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 01:04:27,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=667, Unknown=0, NotChecked=0, Total=870 [2022-04-15 01:04:27,969 INFO L87 Difference]: Start difference. First operand 222 states and 320 transitions. Second operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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-15 01:05:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:05:00,675 INFO L93 Difference]: Finished difference Result 774 states and 1227 transitions. [2022-04-15 01:05:00,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 01:05:00,675 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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 28 [2022-04-15 01:05:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:05:00,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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-15 01:05:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 423 transitions. [2022-04-15 01:05:00,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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-15 01:05:00,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 423 transitions. [2022-04-15 01:05:00,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 423 transitions. [2022-04-15 01:05:06,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 423 edges. 423 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:05:06,115 INFO L225 Difference]: With dead ends: 774 [2022-04-15 01:05:06,115 INFO L226 Difference]: Without dead ends: 719 [2022-04-15 01:05:06,117 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 25.3s TimeCoverageRelationStatistics Valid=1980, Invalid=5676, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 01:05:06,117 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 1346 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1839 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 1839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 01:05:06,118 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1346 Valid, 138 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 1839 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 01:05:06,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2022-04-15 01:05:06,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 360. [2022-04-15 01:05:06,520 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:05:06,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:06,521 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:06,521 INFO L87 Difference]: Start difference. First operand 719 states. Second operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:06,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:05:06,536 INFO L93 Difference]: Finished difference Result 719 states and 1032 transitions. [2022-04-15 01:05:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1032 transitions. [2022-04-15 01:05:06,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:05:06,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:05:06,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 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 719 states. [2022-04-15 01:05:06,538 INFO L87 Difference]: Start difference. First operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 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 719 states. [2022-04-15 01:05:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:05:06,553 INFO L93 Difference]: Finished difference Result 719 states and 1032 transitions. [2022-04-15 01:05:06,553 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 1032 transitions. [2022-04-15 01:05:06,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:05:06,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:05:06,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:05:06,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:05:06,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 355 states have (on average 1.4873239436619718) internal successors, (528), 355 states have internal predecessors, (528), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 532 transitions. [2022-04-15 01:05:06,560 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 532 transitions. Word has length 28 [2022-04-15 01:05:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:05:06,560 INFO L478 AbstractCegarLoop]: Abstraction has 360 states and 532 transitions. [2022-04-15 01:05:06,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.4) internal successors, (42), 29 states have internal predecessors, (42), 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-15 01:05:06,560 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 532 transitions. [2022-04-15 01:05:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 01:05:06,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:05:06,561 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:05:06,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 01:05:06,765 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 01:05:06,765 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:05:06,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:05:06,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1644562479, now seen corresponding path program 4 times [2022-04-15 01:05:06,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:05:06,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403784910] [2022-04-15 01:05:06,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:05:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:05:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:05:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:05:07,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:05:07,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {14363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {14348#true} is VALID [2022-04-15 01:05:07,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {14348#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:07,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14348#true} {14348#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:07,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {14348#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:05:07,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {14363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {14348#true} is VALID [2022-04-15 01:05:07,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {14348#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:07,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14348#true} {14348#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:07,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {14348#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:07,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {14348#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 01:05:07,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:05:07,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14355#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} is VALID [2022-04-15 01:05:07,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {14355#(and (<= 2 main_~y~0) (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~x~0) (* (- 1) main_~y~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2) (<= main_~n~0 (+ (* (div (+ main_~n~0 (* (- 1) main_~y~0)) 4294967296) 4294967296) 4294967295)))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14356#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:05:07,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {14356#(and (<= (+ (* (div (+ main_~n~0 4294967295 (* (- 1) main_~y~0)) 4294967296) 4294967296) 2) main_~n~0) (<= main_~y~0 2))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:07,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,164 INFO L290 TraceCheckUtils]: 11: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:07,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:07,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:07,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:07,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:07,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,173 INFO L290 TraceCheckUtils]: 20: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,173 INFO L290 TraceCheckUtils]: 21: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-15 01:05:07,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:07,176 INFO L290 TraceCheckUtils]: 24: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:07,177 INFO L272 TraceCheckUtils]: 25: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {14361#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:05:07,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {14361#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14362#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:05:07,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {14362#(not (= __VERIFIER_assert_~cond 0))} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {14349#false} is VALID [2022-04-15 01:05:07,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {14349#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14349#false} is VALID [2022-04-15 01:05:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:05:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:05:07,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403784910] [2022-04-15 01:05:07,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403784910] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:05:07,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816037450] [2022-04-15 01:05:07,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 01:05:07,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:05:07,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:05:07,179 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:05:07,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 01:05:07,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 01:05:07,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:05:07,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 01:05:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:05:07,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:05:34,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {14348#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:34,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {14348#true} [99] 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) 10) (= (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] {14348#true} is VALID [2022-04-15 01:05:34,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {14348#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:34,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14348#true} {14348#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:34,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {14348#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:34,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {14348#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 01:05:34,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {14353#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:05:34,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {14354#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14388#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-15 01:05:34,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {14388#(and (<= 2 main_~y~0) (<= main_~y~0 2) (< 0 (mod (+ main_~x~0 1) 4294967296)) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14392#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-15 01:05:34,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {14392#(and (<= 2 main_~y~0) (<= main_~y~0 2) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {14396#(and (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 2 main_~z~0))} is VALID [2022-04-15 01:05:34,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {14396#(and (<= main_~z~0 2) (<= main_~x~0 (+ (* (div (+ main_~z~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)) (<= (mod main_~x~0 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 2 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {14400#(and (<= main_~z~0 1) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= 1 main_~z~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} is VALID [2022-04-15 01:05:34,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {14400#(and (<= main_~z~0 1) (<= main_~x~0 (+ 4294967294 (* 4294967296 (div (+ main_~z~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296)))) (<= (mod (+ main_~x~0 4294967295) 4294967296) 0) (<= 1 main_~z~0) (<= (+ main_~z~0 main_~x~0) main_~n~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:05:34,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 0 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:05:34,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {14404#(and (<= main_~z~0 0) (<= main_~x~0 (+ 4294967295 (* (div (+ main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= (+ main_~z~0 main_~x~0) main_~n~0) (<= 0 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {14411#(and (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= 1 main_~z~0))} is VALID [2022-04-15 01:05:34,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {14411#(and (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 1)) (<= main_~x~0 (+ (* 4294967296 (div (+ (- 1) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296)) 4294967295)) (<= main_~z~0 1) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= 1 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} is VALID [2022-04-15 01:05:34,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} is VALID [2022-04-15 01:05:34,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {14415#(and (<= main_~x~0 (+ 4294967295 (* (div (+ (- 2) main_~z~0 main_~x~0 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (mod (+ main_~x~0 4294967294) 4294967296) 0) (<= main_~z~0 2) (<= (+ main_~z~0 main_~x~0) (+ main_~n~0 2)) (<= 2 main_~z~0))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:34,304 INFO L290 TraceCheckUtils]: 17: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:34,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:34,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-15 01:05:34,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-15 01:05:34,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} is VALID [2022-04-15 01:05:34,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {14359#(and (<= main_~z~0 0) (<= (+ (* 4294967296 (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967293) 4294967296)) 2) main_~n~0))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} is VALID [2022-04-15 01:05:34,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {14358#(and (<= main_~z~0 1) (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967294) 4294967296) 4294967296) 2) main_~n~0))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:34,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} is VALID [2022-04-15 01:05:34,311 INFO L272 TraceCheckUtils]: 25: Hoare triple {14357#(and (<= (+ (* (div (+ main_~n~0 (* (- 1) main_~z~0) 4294967295) 4294967296) 4294967296) 2) main_~n~0) (<= main_~z~0 2))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:05:34,311 INFO L290 TraceCheckUtils]: 26: Hoare triple {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:05:34,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {14453#(<= 1 __VERIFIER_assert_~cond)} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {14349#false} is VALID [2022-04-15 01:05:34,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {14349#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14349#false} is VALID [2022-04-15 01:05:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 01:05:34,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:05:35,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {14349#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14349#false} is VALID [2022-04-15 01:05:35,127 INFO L290 TraceCheckUtils]: 27: Hoare triple {14453#(<= 1 __VERIFIER_assert_~cond)} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {14349#false} is VALID [2022-04-15 01:05:35,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {14453#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:05:35,128 INFO L272 TraceCheckUtils]: 25: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {14449#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:05:35,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 01:05:35,132 INFO L290 TraceCheckUtils]: 20: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 01:05:35,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {14360#(and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 01:05:35,139 INFO L290 TraceCheckUtils]: 11: Hoare triple {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {14479#(and (< (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~z~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~z~0 2) 4294967296) 4294967296) main_~n~0)))} is VALID [2022-04-15 01:05:35,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {14516#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {14475#(and (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~z~0 1) 4294967296) 4294967296)) (+ main_~z~0 2 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:05:35,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {14520#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {14516#(or (and (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)))) (<= (mod main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:05:35,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {14524#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {14520#(or (<= (mod main_~y~0 4294967296) 0) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-15 01:05:35,144 INFO L290 TraceCheckUtils]: 7: Hoare triple {14528#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14524#(or (<= (mod main_~y~0 4294967296) 0) (< 0 (mod main_~x~0 4294967296)) (and (< (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0) (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div main_~y~0 4294967296) 4294967296) main_~n~0))))} is VALID [2022-04-15 01:05:35,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {14532#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14528#(or (<= (mod (+ main_~y~0 1) 4294967296) 0) (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (and (<= (+ main_~y~0 (* (div main_~n~0 4294967296) 4294967296) 1) (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296))) (< (+ main_~n~0 (* (div (+ main_~y~0 1) 4294967296) 4294967296)) (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 01:05:35,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {14348#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {14532#(or (<= (mod (+ main_~y~0 2) 4294967296) 0) (and (< (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0) (+ main_~y~0 3 (* (div main_~n~0 4294967296) 4294967296))) (<= (+ main_~y~0 2 (* (div main_~n~0 4294967296) 4294967296)) (+ (* (div (+ main_~y~0 2) 4294967296) 4294967296) main_~n~0))) (< 0 (mod (+ main_~x~0 4294967294) 4294967296)))} is VALID [2022-04-15 01:05:35,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {14348#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:35,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14348#true} {14348#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:35,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {14348#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:35,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {14348#true} [99] 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) 10) (= (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] {14348#true} is VALID [2022-04-15 01:05:35,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {14348#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14348#true} is VALID [2022-04-15 01:05:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:05:35,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816037450] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:05:35,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:05:35,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 12] total 29 [2022-04-15 01:05:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966304804] [2022-04-15 01:05:35,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:05:35,148 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 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 29 [2022-04-15 01:05:35,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:05:35,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 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-15 01:05:35,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:05:35,316 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 01:05:35,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:05:35,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 01:05:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=703, Unknown=0, NotChecked=0, Total=812 [2022-04-15 01:05:35,316 INFO L87 Difference]: Start difference. First operand 360 states and 532 transitions. Second operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 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-15 01:05:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:05:52,393 INFO L93 Difference]: Finished difference Result 520 states and 719 transitions. [2022-04-15 01:05:52,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 01:05:52,393 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 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 29 [2022-04-15 01:05:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:05:52,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 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-15 01:05:52,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 123 transitions. [2022-04-15 01:05:52,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 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-15 01:05:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 123 transitions. [2022-04-15 01:05:52,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 123 transitions. [2022-04-15 01:05:53,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:05:53,015 INFO L225 Difference]: With dead ends: 520 [2022-04-15 01:05:53,015 INFO L226 Difference]: Without dead ends: 508 [2022-04-15 01:05:53,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1564 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=681, Invalid=4720, Unknown=1, NotChecked=0, Total=5402 [2022-04-15 01:05:53,017 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 107 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 01:05:53,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 83 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 01:05:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2022-04-15 01:05:53,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 373. [2022-04-15 01:05:53,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:05:53,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 508 states. Second operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:53,488 INFO L74 IsIncluded]: Start isIncluded. First operand 508 states. Second operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:53,489 INFO L87 Difference]: Start difference. First operand 508 states. Second operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:53,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:05:53,501 INFO L93 Difference]: Finished difference Result 508 states and 705 transitions. [2022-04-15 01:05:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 705 transitions. [2022-04-15 01:05:53,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:05:53,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:05:53,503 INFO L74 IsIncluded]: Start isIncluded. First operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 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 508 states. [2022-04-15 01:05:53,504 INFO L87 Difference]: Start difference. First operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 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 508 states. [2022-04-15 01:05:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:05:53,516 INFO L93 Difference]: Finished difference Result 508 states and 705 transitions. [2022-04-15 01:05:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 705 transitions. [2022-04-15 01:05:53,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:05:53,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:05:53,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:05:53,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:05:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 368 states have (on average 1.4809782608695652) internal successors, (545), 368 states have internal predecessors, (545), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:05:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 549 transitions. [2022-04-15 01:05:53,525 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 549 transitions. Word has length 29 [2022-04-15 01:05:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:05:53,525 INFO L478 AbstractCegarLoop]: Abstraction has 373 states and 549 transitions. [2022-04-15 01:05:53,525 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 26 states have internal predecessors, (57), 3 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-15 01:05:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 549 transitions. [2022-04-15 01:05:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 01:05:53,526 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:05:53,526 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:05:53,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 01:05:53,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 01:05:53,739 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:05:53,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:05:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1767974865, now seen corresponding path program 4 times [2022-04-15 01:05:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:05:53,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409233345] [2022-04-15 01:05:53,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:05:53,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:05:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:05:53,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:05:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:05:53,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {16753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {16737#true} is VALID [2022-04-15 01:05:53,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:53,939 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16737#true} {16737#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:53,940 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:05:53,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {16753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {16737#true} is VALID [2022-04-15 01:05:53,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:53,940 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:53,940 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:53,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {16742#(= main_~y~0 0)} is VALID [2022-04-15 01:05:53,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {16742#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:05:53,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {16743#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:05:53,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {16744#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:05:53,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {16745#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:05:53,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:05:53,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {16746#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {16747#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:05:53,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {16747#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:05:53,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {16748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:05:53,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {16749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16750#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:05:53,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {16750#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16751#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:05:53,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {16751#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {16751#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:05:53,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {16751#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16750#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:05:53,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {16750#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:05:53,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {16749#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:05:53,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {16748#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:05:53,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:05:53,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:05:53,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {16752#(and (<= 4 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:53,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {16738#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:53,951 INFO L272 TraceCheckUtils]: 25: Hoare triple {16738#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {16738#false} is VALID [2022-04-15 01:05:53,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {16738#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16738#false} is VALID [2022-04-15 01:05:53,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {16738#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:53,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:05:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:05:53,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409233345] [2022-04-15 01:05:53,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409233345] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:05:53,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341186913] [2022-04-15 01:05:53,951 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 01:05:53,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:05:53,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:05:53,952 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:05:53,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 01:05:53,994 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 01:05:53,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:05:53,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 01:05:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:05:54,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:05:54,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} [99] 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) 10) (= (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] {16737#true} is VALID [2022-04-15 01:05:54,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {16737#true} is VALID [2022-04-15 01:05:54,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {16737#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:05:54,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:05:54,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:05:54,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:05:54,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:05:54,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:05:54,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:05:54,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:05:54,147 INFO L290 TraceCheckUtils]: 14: Hoare triple {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:05:54,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,148 INFO L290 TraceCheckUtils]: 16: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,149 INFO L290 TraceCheckUtils]: 23: Hoare triple {16738#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,149 INFO L290 TraceCheckUtils]: 24: Hoare triple {16738#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,149 INFO L272 TraceCheckUtils]: 25: Hoare triple {16738#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {16738#false} is VALID [2022-04-15 01:05:54,149 INFO L290 TraceCheckUtils]: 26: Hoare triple {16738#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16738#false} is VALID [2022-04-15 01:05:54,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {16738#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,150 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 01:05:54,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:05:54,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {16738#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,239 INFO L290 TraceCheckUtils]: 27: Hoare triple {16738#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,239 INFO L290 TraceCheckUtils]: 26: Hoare triple {16738#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {16738#false} is VALID [2022-04-15 01:05:54,239 INFO L272 TraceCheckUtils]: 25: Hoare triple {16738#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {16738#false} is VALID [2022-04-15 01:05:54,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {16738#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {16738#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {16738#false} is VALID [2022-04-15 01:05:54,240 INFO L290 TraceCheckUtils]: 21: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,240 INFO L290 TraceCheckUtils]: 19: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,240 INFO L290 TraceCheckUtils]: 18: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,241 INFO L290 TraceCheckUtils]: 17: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,241 INFO L290 TraceCheckUtils]: 16: Hoare triple {16806#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16806#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:05:54,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:05:54,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:05:54,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:05:54,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:05:54,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:05:54,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16787#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:05:54,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16783#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:05:54,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16779#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:05:54,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {16737#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16775#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:05:54,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {16737#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {16737#true} is VALID [2022-04-15 01:05:54,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {16737#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16737#true} {16737#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {16737#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {16737#true} [99] 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) 10) (= (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] {16737#true} is VALID [2022-04-15 01:05:54,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {16737#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16737#true} is VALID [2022-04-15 01:05:54,247 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 01:05:54,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341186913] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:05:54,247 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:05:54,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 19 [2022-04-15 01:05:54,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356158152] [2022-04-15 01:05:54,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:05:54,248 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 29 [2022-04-15 01:05:54,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:05:54,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 01:05:54,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:05:54,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 01:05:54,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:05:54,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 01:05:54,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-04-15 01:05:54,286 INFO L87 Difference]: Start difference. First operand 373 states and 549 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 01:06:05,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:05,701 INFO L93 Difference]: Finished difference Result 972 states and 1402 transitions. [2022-04-15 01:06:05,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-04-15 01:06:05,701 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 29 [2022-04-15 01:06:05,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:06:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 01:06:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 342 transitions. [2022-04-15 01:06:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 01:06:05,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 342 transitions. [2022-04-15 01:06:05,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 342 transitions. [2022-04-15 01:06:06,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:06,259 INFO L225 Difference]: With dead ends: 972 [2022-04-15 01:06:06,259 INFO L226 Difference]: Without dead ends: 900 [2022-04-15 01:06:06,262 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6101 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1543, Invalid=15227, Unknown=0, NotChecked=0, Total=16770 [2022-04-15 01:06:06,263 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 343 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 2142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:06:06,263 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 108 Invalid, 2142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 01:06:06,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2022-04-15 01:06:06,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 425. [2022-04-15 01:06:06,784 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:06:06,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 900 states. Second operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:06,785 INFO L74 IsIncluded]: Start isIncluded. First operand 900 states. Second operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:06,785 INFO L87 Difference]: Start difference. First operand 900 states. Second operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:06,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:06,808 INFO L93 Difference]: Finished difference Result 900 states and 1218 transitions. [2022-04-15 01:06:06,808 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1218 transitions. [2022-04-15 01:06:06,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:06,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:06,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 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 900 states. [2022-04-15 01:06:06,810 INFO L87 Difference]: Start difference. First operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 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 900 states. [2022-04-15 01:06:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:06,832 INFO L93 Difference]: Finished difference Result 900 states and 1218 transitions. [2022-04-15 01:06:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1218 transitions. [2022-04-15 01:06:06,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:06,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:06,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:06:06,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:06:06,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 420 states have (on average 1.4952380952380953) internal successors, (628), 420 states have internal predecessors, (628), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 632 transitions. [2022-04-15 01:06:06,840 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 632 transitions. Word has length 29 [2022-04-15 01:06:06,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:06:06,841 INFO L478 AbstractCegarLoop]: Abstraction has 425 states and 632 transitions. [2022-04-15 01:06:06,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 01:06:06,841 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 632 transitions. [2022-04-15 01:06:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 01:06:06,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:06:06,841 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:06:06,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 01:06:07,055 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 01:06:07,055 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:06:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:06:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1387880047, now seen corresponding path program 5 times [2022-04-15 01:06:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:06:07,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047956718] [2022-04-15 01:06:07,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:06:07,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:06:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:07,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:06:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:07,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {20588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {20580#true} is VALID [2022-04-15 01:06:07,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {20580#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,147 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20580#true} {20580#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,147 INFO L272 TraceCheckUtils]: 0: Hoare triple {20580#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:06:07,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {20588#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {20580#true} is VALID [2022-04-15 01:06:07,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {20580#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20580#true} {20580#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {20580#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {20580#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {20580#true} is VALID [2022-04-15 01:06:07,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {20580#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20580#true} is VALID [2022-04-15 01:06:07,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {20580#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20580#true} is VALID [2022-04-15 01:06:07,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {20580#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:06:07,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:06:07,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20581#false} is VALID [2022-04-15 01:06:07,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {20581#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {20581#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {20581#false} is VALID [2022-04-15 01:06:07,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {20581#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {20581#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {20581#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L272 TraceCheckUtils]: 27: Hoare triple {20581#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {20581#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {20581#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L290 TraceCheckUtils]: 30: Hoare triple {20581#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 01:06:07,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:06:07,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047956718] [2022-04-15 01:06:07,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047956718] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:06:07,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223703073] [2022-04-15 01:06:07,154 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-15 01:06:07,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:07,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:06:07,155 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:06:07,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 01:06:07,210 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-04-15 01:06:07,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:06:07,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 01:06:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:07,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:06:07,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {20580#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {20580#true} [99] 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) 10) (= (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] {20580#true} is VALID [2022-04-15 01:06:07,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {20580#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20580#true} {20580#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {20580#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {20580#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {20580#true} is VALID [2022-04-15 01:06:07,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {20580#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20580#true} is VALID [2022-04-15 01:06:07,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {20580#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20580#true} is VALID [2022-04-15 01:06:07,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {20580#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:06:07,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:06:07,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {20581#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {20581#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {20581#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {20581#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {20581#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L272 TraceCheckUtils]: 27: Hoare triple {20581#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {20581#false} is VALID [2022-04-15 01:06:07,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {20581#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {20581#false} is VALID [2022-04-15 01:06:07,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {20581#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {20581#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 01:06:07,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {20581#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {20581#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 28: Hoare triple {20581#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L272 TraceCheckUtils]: 27: Hoare triple {20581#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {20581#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 25: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {20581#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {20581#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {20581#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {20581#false} is VALID [2022-04-15 01:06:07,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {20581#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {20581#false} is VALID [2022-04-15 01:06:07,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {20581#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {20581#false} is VALID [2022-04-15 01:06:07,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20581#false} is VALID [2022-04-15 01:06:07,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:06:07,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,384 INFO L290 TraceCheckUtils]: 13: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {20587#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:07,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {20586#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:06:07,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {20580#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {20585#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:06:07,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {20580#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20580#true} is VALID [2022-04-15 01:06:07,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {20580#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20580#true} is VALID [2022-04-15 01:06:07,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {20580#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {20580#true} is VALID [2022-04-15 01:06:07,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {20580#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20580#true} {20580#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {20580#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {20580#true} [99] 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) 10) (= (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] {20580#true} is VALID [2022-04-15 01:06:07,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {20580#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20580#true} is VALID [2022-04-15 01:06:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 01:06:07,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223703073] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:06:07,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:06:07,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 6 [2022-04-15 01:06:07,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649757326] [2022-04-15 01:06:07,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:06:07,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-15 01:06:07,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:06:07,388 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-15 01:06:07,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:07,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 01:06:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:06:07,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 01:06:07,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 01:06:07,406 INFO L87 Difference]: Start difference. First operand 425 states and 632 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-15 01:06:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:08,284 INFO L93 Difference]: Finished difference Result 667 states and 980 transitions. [2022-04-15 01:06:08,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 01:06:08,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-15 01:06:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:06:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-15 01:06:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-15 01:06:08,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-15 01:06:08,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-15 01:06:08,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-15 01:06:08,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:08,342 INFO L225 Difference]: With dead ends: 667 [2022-04-15 01:06:08,342 INFO L226 Difference]: Without dead ends: 522 [2022-04-15 01:06:08,342 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-15 01:06:08,351 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 35 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 01:06:08,351 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 55 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 01:06:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2022-04-15 01:06:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 390. [2022-04-15 01:06:08,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:06:08,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 522 states. Second operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:08,880 INFO L74 IsIncluded]: Start isIncluded. First operand 522 states. Second operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:08,880 INFO L87 Difference]: Start difference. First operand 522 states. Second operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:08,888 INFO L93 Difference]: Finished difference Result 522 states and 754 transitions. [2022-04-15 01:06:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 754 transitions. [2022-04-15 01:06:08,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:08,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:08,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 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 522 states. [2022-04-15 01:06:08,890 INFO L87 Difference]: Start difference. First operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 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 522 states. [2022-04-15 01:06:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:08,899 INFO L93 Difference]: Finished difference Result 522 states and 754 transitions. [2022-04-15 01:06:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 754 transitions. [2022-04-15 01:06:08,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:08,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:08,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:06:08,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:06:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 385 states have (on average 1.4805194805194806) internal successors, (570), 385 states have internal predecessors, (570), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 574 transitions. [2022-04-15 01:06:08,906 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 574 transitions. Word has length 31 [2022-04-15 01:06:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:06:08,906 INFO L478 AbstractCegarLoop]: Abstraction has 390 states and 574 transitions. [2022-04-15 01:06:08,906 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 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-15 01:06:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 574 transitions. [2022-04-15 01:06:08,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 01:06:08,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:06:08,907 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:06:08,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 01:06:09,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:09,123 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:06:09,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:06:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1284495769, now seen corresponding path program 6 times [2022-04-15 01:06:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:06:09,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519319367] [2022-04-15 01:06:09,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:06:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:06:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:09,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:06:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:09,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {23089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {23077#true} is VALID [2022-04-15 01:06:09,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {23077#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23077#true} {23077#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {23077#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:06:09,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {23089#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {23077#true} is VALID [2022-04-15 01:06:09,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {23077#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23077#true} {23077#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {23077#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,235 INFO L290 TraceCheckUtils]: 5: Hoare triple {23077#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {23077#true} is VALID [2022-04-15 01:06:09,236 INFO L290 TraceCheckUtils]: 6: Hoare triple {23077#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:06:09,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23083#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} is VALID [2022-04-15 01:06:09,238 INFO L290 TraceCheckUtils]: 8: Hoare triple {23083#(<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 4294967293))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-15 01:06:09,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-15 01:06:09,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} is VALID [2022-04-15 01:06:09,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {23084#(<= (* 4294967296 (div (+ main_~x~0 3) 4294967296)) main_~x~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23085#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 01:06:09,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {23085#(<= (+ (* (div (+ main_~x~0 2) 4294967296) 4294967296) 1) main_~x~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23086#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 01:06:09,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {23086#(<= (+ 2 (* (div (+ main_~x~0 1) 4294967296) 4294967296)) main_~x~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:06:09,242 INFO L290 TraceCheckUtils]: 14: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:06:09,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:06:09,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:06:09,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:06:09,243 INFO L290 TraceCheckUtils]: 18: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:06:09,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {23087#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {23088#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {23088#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 24: Hoare triple {23078#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 25: Hoare triple {23078#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {23078#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L272 TraceCheckUtils]: 27: Hoare triple {23078#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {23078#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 29: Hoare triple {23078#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,245 INFO L290 TraceCheckUtils]: 30: Hoare triple {23078#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-15 01:06:09,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:06:09,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519319367] [2022-04-15 01:06:09,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519319367] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:06:09,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150899453] [2022-04-15 01:06:09,246 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 01:06:09,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:09,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:06:09,247 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:06:09,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 01:06:09,284 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 01:06:09,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:06:09,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 01:06:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:09,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:06:09,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {23077#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {23077#true} [99] 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) 10) (= (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] {23077#true} is VALID [2022-04-15 01:06:09,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {23077#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23077#true} {23077#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {23077#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {23077#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {23077#true} is VALID [2022-04-15 01:06:09,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {23077#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23077#true} is VALID [2022-04-15 01:06:09,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {23077#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:06:09,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 01:06:09,541 INFO L290 TraceCheckUtils]: 9: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 01:06:09,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 01:06:09,542 INFO L290 TraceCheckUtils]: 11: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:06:09,542 INFO L290 TraceCheckUtils]: 12: Hoare triple {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,545 INFO L290 TraceCheckUtils]: 19: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 20: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {23078#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {23078#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {23078#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L272 TraceCheckUtils]: 27: Hoare triple {23078#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {23078#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {23078#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L290 TraceCheckUtils]: 30: Hoare triple {23078#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,546 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 01:06:09,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:06:09,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {23078#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {23078#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {23078#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {23078#false} is VALID [2022-04-15 01:06:09,646 INFO L272 TraceCheckUtils]: 27: Hoare triple {23078#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {23078#false} is VALID [2022-04-15 01:06:09,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {23078#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {23078#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {23078#false} is VALID [2022-04-15 01:06:09,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {23078#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {23078#false} is VALID [2022-04-15 01:06:09,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {23078#false} is VALID [2022-04-15 01:06:09,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23134#(<= main_~x~0 (+ 4294967296 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23130#(<= main_~x~0 (+ 4294967295 (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:06:09,653 INFO L290 TraceCheckUtils]: 11: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:06:09,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 01:06:09,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 01:06:09,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23117#(<= main_~x~0 (+ (* (div (+ main_~x~0 1) 4294967296) 4294967296) 4294967293))} is VALID [2022-04-15 01:06:09,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {23077#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23082#(<= main_~x~0 (+ 4294967294 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 01:06:09,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {23077#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23077#true} is VALID [2022-04-15 01:06:09,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {23077#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {23077#true} is VALID [2022-04-15 01:06:09,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {23077#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23077#true} {23077#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {23077#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {23077#true} [99] 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) 10) (= (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] {23077#true} is VALID [2022-04-15 01:06:09,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {23077#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23077#true} is VALID [2022-04-15 01:06:09,656 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 01:06:09,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150899453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:06:09,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:06:09,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 13 [2022-04-15 01:06:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474333516] [2022-04-15 01:06:09,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:06:09,656 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-15 01:06:09,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:06:09,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-15 01:06:09,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:09,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 01:06:09,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:06:09,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 01:06:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 01:06:09,687 INFO L87 Difference]: Start difference. First operand 390 states and 574 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-15 01:06:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:11,044 INFO L93 Difference]: Finished difference Result 640 states and 921 transitions. [2022-04-15 01:06:11,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 01:06:11,044 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-15 01:06:11,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:06:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-15 01:06:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2022-04-15 01:06:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-15 01:06:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 94 transitions. [2022-04-15 01:06:11,045 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 94 transitions. [2022-04-15 01:06:11,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:11,145 INFO L225 Difference]: With dead ends: 640 [2022-04-15 01:06:11,145 INFO L226 Difference]: Without dead ends: 611 [2022-04-15 01:06:11,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2022-04-15 01:06:11,146 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 104 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 01:06:11,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 71 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 01:06:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-04-15 01:06:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 412. [2022-04-15 01:06:11,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:06:11,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 611 states. Second operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:11,684 INFO L74 IsIncluded]: Start isIncluded. First operand 611 states. Second operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:11,684 INFO L87 Difference]: Start difference. First operand 611 states. Second operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:11,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:11,695 INFO L93 Difference]: Finished difference Result 611 states and 874 transitions. [2022-04-15 01:06:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 874 transitions. [2022-04-15 01:06:11,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:11,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:11,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 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 611 states. [2022-04-15 01:06:11,696 INFO L87 Difference]: Start difference. First operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 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 611 states. [2022-04-15 01:06:11,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:11,708 INFO L93 Difference]: Finished difference Result 611 states and 874 transitions. [2022-04-15 01:06:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 874 transitions. [2022-04-15 01:06:11,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:11,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:11,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:06:11,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:06:11,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 407 states have (on average 1.452088452088452) internal successors, (591), 407 states have internal predecessors, (591), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:11,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 595 transitions. [2022-04-15 01:06:11,715 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 595 transitions. Word has length 31 [2022-04-15 01:06:11,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:06:11,715 INFO L478 AbstractCegarLoop]: Abstraction has 412 states and 595 transitions. [2022-04-15 01:06:11,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 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-15 01:06:11,715 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 595 transitions. [2022-04-15 01:06:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 01:06:11,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:06:11,716 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:06:11,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 01:06:11,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 01:06:11,931 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:06:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:06:11,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1868094221, now seen corresponding path program 5 times [2022-04-15 01:06:11,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:06:11,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895697921] [2022-04-15 01:06:11,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:06:11,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:06:11,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:12,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:06:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:12,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {25786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {25768#true} is VALID [2022-04-15 01:06:12,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {25768#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,141 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25768#true} {25768#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,141 INFO L272 TraceCheckUtils]: 0: Hoare triple {25768#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:06:12,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {25786#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {25768#true} is VALID [2022-04-15 01:06:12,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {25768#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25768#true} {25768#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {25768#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {25768#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {25773#(= main_~y~0 0)} is VALID [2022-04-15 01:06:12,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {25773#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:06:12,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {25774#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:06:12,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {25775#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25776#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:06:12,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {25776#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25777#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:06:12,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {25777#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:06:12,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:06:12,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {25778#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {25779#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 01:06:12,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {25779#(and (<= main_~z~0 5) (<= 5 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25780#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:06:12,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {25780#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25781#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:06:12,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {25781#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:06:12,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {25782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25783#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:06:12,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {25783#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25784#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:06:12,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {25784#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {25784#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:06:12,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {25784#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25783#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:06:12,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {25783#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:06:12,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {25782#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25781#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:06:12,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {25781#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25780#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:06:12,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {25780#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:06:12,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:06:12,151 INFO L290 TraceCheckUtils]: 25: Hoare triple {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} is VALID [2022-04-15 01:06:12,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {25785#(and (<= 5 main_~z~0) (<= (div main_~z~0 4294967296) 0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {25769#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,152 INFO L272 TraceCheckUtils]: 28: Hoare triple {25769#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {25769#false} is VALID [2022-04-15 01:06:12,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {25769#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25769#false} is VALID [2022-04-15 01:06:12,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {25769#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,152 INFO L290 TraceCheckUtils]: 31: Hoare triple {25769#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:06:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:06:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895697921] [2022-04-15 01:06:12,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895697921] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:06:12,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164655736] [2022-04-15 01:06:12,152 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-15 01:06:12,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:12,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:06:12,153 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:06:12,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 01:06:12,355 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-04-15 01:06:12,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:06:12,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 01:06:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:12,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:06:12,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {25768#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {25768#true} [99] 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) 10) (= (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] {25768#true} is VALID [2022-04-15 01:06:12,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {25768#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25768#true} {25768#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {25768#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {25768#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {25768#true} is VALID [2022-04-15 01:06:12,552 INFO L290 TraceCheckUtils]: 6: Hoare triple {25768#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:12,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:12,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:12,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:12,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:12,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:12,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:12,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:12,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:12,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:12,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:12,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,560 INFO L290 TraceCheckUtils]: 24: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {25769#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {25769#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,560 INFO L272 TraceCheckUtils]: 28: Hoare triple {25769#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {25769#false} is VALID [2022-04-15 01:06:12,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {25769#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25769#false} is VALID [2022-04-15 01:06:12,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {25769#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,561 INFO L290 TraceCheckUtils]: 31: Hoare triple {25769#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,561 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 01:06:12,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:06:12,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {25769#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {25769#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {25769#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {25769#false} is VALID [2022-04-15 01:06:12,661 INFO L272 TraceCheckUtils]: 28: Hoare triple {25769#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {25769#false} is VALID [2022-04-15 01:06:12,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {25769#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {25769#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {25769#false} is VALID [2022-04-15 01:06:12,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,662 INFO L290 TraceCheckUtils]: 23: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {25846#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25846#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:12,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:12,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:12,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:12,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:12,666 INFO L290 TraceCheckUtils]: 12: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:12,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:12,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25824#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:12,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25820#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:12,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25816#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:12,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25812#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:12,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {25768#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25808#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:12,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {25768#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {25768#true} is VALID [2022-04-15 01:06:12,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {25768#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25768#true} {25768#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {25768#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {25768#true} [99] 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) 10) (= (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] {25768#true} is VALID [2022-04-15 01:06:12,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {25768#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25768#true} is VALID [2022-04-15 01:06:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 01:06:12,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164655736] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:06:12,670 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:06:12,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8, 8] total 22 [2022-04-15 01:06:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15179986] [2022-04-15 01:06:12,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:06:12,671 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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 32 [2022-04-15 01:06:12,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:06:12,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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-15 01:06:12,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:12,710 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 01:06:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:06:12,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 01:06:12,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-04-15 01:06:12,711 INFO L87 Difference]: Start difference. First operand 412 states and 595 transitions. Second operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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-15 01:06:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:33,154 INFO L93 Difference]: Finished difference Result 1100 states and 1569 transitions. [2022-04-15 01:06:33,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-04-15 01:06:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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 32 [2022-04-15 01:06:33,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:06:33,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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-15 01:06:33,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 429 transitions. [2022-04-15 01:06:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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-15 01:06:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 429 transitions. [2022-04-15 01:06:33,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 429 transitions. [2022-04-15 01:06:33,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 429 edges. 429 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:33,949 INFO L225 Difference]: With dead ends: 1100 [2022-04-15 01:06:33,949 INFO L226 Difference]: Without dead ends: 1025 [2022-04-15 01:06:33,952 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11145 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2268, Invalid=27144, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 01:06:33,952 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 390 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 661 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 661 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-15 01:06:33,952 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [390 Valid, 129 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [661 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-15 01:06:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1025 states. [2022-04-15 01:06:34,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1025 to 487. [2022-04-15 01:06:34,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:06:34,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1025 states. Second operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:34,556 INFO L74 IsIncluded]: Start isIncluded. First operand 1025 states. Second operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:34,556 INFO L87 Difference]: Start difference. First operand 1025 states. Second operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:34,583 INFO L93 Difference]: Finished difference Result 1025 states and 1369 transitions. [2022-04-15 01:06:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1369 transitions. [2022-04-15 01:06:34,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:34,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:34,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 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 1025 states. [2022-04-15 01:06:34,585 INFO L87 Difference]: Start difference. First operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 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 1025 states. [2022-04-15 01:06:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:34,612 INFO L93 Difference]: Finished difference Result 1025 states and 1369 transitions. [2022-04-15 01:06:34,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1369 transitions. [2022-04-15 01:06:34,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:34,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:34,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:06:34,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:06:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 482 states have (on average 1.4481327800829875) internal successors, (698), 482 states have internal predecessors, (698), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 702 transitions. [2022-04-15 01:06:34,621 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 702 transitions. Word has length 32 [2022-04-15 01:06:34,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:06:34,621 INFO L478 AbstractCegarLoop]: Abstraction has 487 states and 702 transitions. [2022-04-15 01:06:34,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1363636363636362) internal successors, (47), 21 states have internal predecessors, (47), 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-15 01:06:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 702 transitions. [2022-04-15 01:06:34,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 01:06:34,622 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:06:34,622 INFO L499 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:06:34,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 01:06:34,826 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 01:06:34,826 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:06:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:06:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash 254992086, now seen corresponding path program 3 times [2022-04-15 01:06:34,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:06:34,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278885925] [2022-04-15 01:06:34,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:06:34,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:06:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:06:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:35,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {30187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {30167#true} is VALID [2022-04-15 01:06:35,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {30167#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30167#true} {30167#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {30167#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:06:35,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {30187#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {30167#true} is VALID [2022-04-15 01:06:35,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {30167#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30167#true} {30167#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {30167#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {30167#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {30172#(= main_~y~0 0)} is VALID [2022-04-15 01:06:35,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {30172#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30173#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:06:35,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {30173#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30174#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:06:35,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {30174#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30175#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:06:35,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {30175#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30176#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:06:35,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {30176#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30177#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:06:35,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {30177#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30178#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:06:35,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {30178#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30179#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:06:35,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {30179#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30180#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-15 01:06:35,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {30180#(and (<= main_~y~0 8) (<= 8 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30181#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-15 01:06:35,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {30181#(and (<= 9 main_~y~0) (<= main_~y~0 9))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30182#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-15 01:06:35,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {30182#(and (<= main_~y~0 10) (<= 10 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30183#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:06:35,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {30183#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-15 01:06:35,088 INFO L290 TraceCheckUtils]: 18: Hoare triple {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-15 01:06:35,088 INFO L290 TraceCheckUtils]: 19: Hoare triple {30184#(and (<= 12 main_~y~0) (<= main_~y~0 12))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {30185#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 01:06:35,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {30185#(and (<= main_~z~0 12) (<= 12 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {30186#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} is VALID [2022-04-15 01:06:35,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {30186#(and (<= (div main_~z~0 4294967296) 0) (<= 11 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {30168#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {30168#false} is VALID [2022-04-15 01:06:35,089 INFO L290 TraceCheckUtils]: 23: Hoare triple {30168#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {30168#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {30168#false} is VALID [2022-04-15 01:06:35,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {30168#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {30168#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {30168#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {30168#false} is VALID [2022-04-15 01:06:35,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {30168#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,090 INFO L272 TraceCheckUtils]: 29: Hoare triple {30168#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {30168#false} is VALID [2022-04-15 01:06:35,090 INFO L290 TraceCheckUtils]: 30: Hoare triple {30168#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30168#false} is VALID [2022-04-15 01:06:35,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {30168#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,090 INFO L290 TraceCheckUtils]: 32: Hoare triple {30168#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 01:06:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:06:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278885925] [2022-04-15 01:06:35,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278885925] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:06:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1693717453] [2022-04-15 01:06:35,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 01:06:35,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:35,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:06:35,091 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:06:35,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 01:06:35,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-04-15 01:06:35,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:06:35,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 01:06:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:35,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:06:35,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {30167#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {30167#true} [99] 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) 10) (= (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] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {30167#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30167#true} {30167#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {30167#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {30167#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 10: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,276 INFO L290 TraceCheckUtils]: 17: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {30167#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,276 INFO L290 TraceCheckUtils]: 19: Hoare triple {30167#true} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {30248#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 01:06:35,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {30248#(= main_~z~0 main_~y~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 01:06:35,277 INFO L290 TraceCheckUtils]: 21: Hoare triple {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 01:06:35,278 INFO L290 TraceCheckUtils]: 22: Hoare triple {30252#(and (< 0 (mod (+ main_~z~0 1) 4294967296)) (= main_~y~0 (+ main_~z~0 1)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 01:06:35,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} is VALID [2022-04-15 01:06:35,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {30259#(and (< 0 (mod (+ main_~y~0 1) 4294967296)) (= main_~z~0 (+ main_~y~0 1)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:35,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:35,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {30168#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {30168#false} is VALID [2022-04-15 01:06:35,280 INFO L290 TraceCheckUtils]: 28: Hoare triple {30168#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,280 INFO L272 TraceCheckUtils]: 29: Hoare triple {30168#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {30168#false} is VALID [2022-04-15 01:06:35,280 INFO L290 TraceCheckUtils]: 30: Hoare triple {30168#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30168#false} is VALID [2022-04-15 01:06:35,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {30168#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {30168#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-04-15 01:06:35,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:06:35,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {30168#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,365 INFO L290 TraceCheckUtils]: 31: Hoare triple {30168#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {30168#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {30168#false} is VALID [2022-04-15 01:06:35,365 INFO L272 TraceCheckUtils]: 29: Hoare triple {30168#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {30168#false} is VALID [2022-04-15 01:06:35,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {30168#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {30168#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {30168#false} is VALID [2022-04-15 01:06:35,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {30168#false} is VALID [2022-04-15 01:06:35,366 INFO L290 TraceCheckUtils]: 25: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:35,366 INFO L290 TraceCheckUtils]: 24: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:35,366 INFO L290 TraceCheckUtils]: 23: Hoare triple {30266#(< 0 (mod main_~z~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:35,367 INFO L290 TraceCheckUtils]: 22: Hoare triple {30321#(< 0 (mod (+ main_~z~0 1) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {30266#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:35,367 INFO L290 TraceCheckUtils]: 21: Hoare triple {30321#(< 0 (mod (+ main_~z~0 1) 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {30321#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {30167#true} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {30321#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {30167#true} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {30167#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 17: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {30167#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {30167#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L272 TraceCheckUtils]: 4: Hoare triple {30167#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30167#true} {30167#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L290 TraceCheckUtils]: 2: Hoare triple {30167#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {30167#true} [99] 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) 10) (= (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] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L272 TraceCheckUtils]: 0: Hoare triple {30167#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30167#true} is VALID [2022-04-15 01:06:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-04-15 01:06:35,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1693717453] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:06:35,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:06:35,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6, 4] total 23 [2022-04-15 01:06:35,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449421704] [2022-04-15 01:06:35,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:06:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 33 [2022-04-15 01:06:35,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:06:35,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 01:06:35,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:35,404 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 01:06:35,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:06:35,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 01:06:35,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=457, Unknown=0, NotChecked=0, Total=506 [2022-04-15 01:06:35,405 INFO L87 Difference]: Start difference. First operand 487 states and 702 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 01:06:43,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:43,570 INFO L93 Difference]: Finished difference Result 840 states and 1237 transitions. [2022-04-15 01:06:43,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-04-15 01:06:43,570 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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 33 [2022-04-15 01:06:43,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:06:43,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 01:06:43,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 344 transitions. [2022-04-15 01:06:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 01:06:43,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 344 transitions. [2022-04-15 01:06:43,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 344 transitions. [2022-04-15 01:06:43,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:43,895 INFO L225 Difference]: With dead ends: 840 [2022-04-15 01:06:43,895 INFO L226 Difference]: Without dead ends: 776 [2022-04-15 01:06:43,896 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2789 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=737, Invalid=8965, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 01:06:43,896 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 198 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3479 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 3479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 01:06:43,896 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 140 Invalid, 3826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 3479 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 01:06:43,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2022-04-15 01:06:44,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 591. [2022-04-15 01:06:44,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:06:44,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 776 states. Second operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:44,630 INFO L74 IsIncluded]: Start isIncluded. First operand 776 states. Second operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:44,630 INFO L87 Difference]: Start difference. First operand 776 states. Second operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:44,653 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2022-04-15 01:06:44,654 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1068 transitions. [2022-04-15 01:06:44,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:44,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:44,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 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 776 states. [2022-04-15 01:06:44,656 INFO L87 Difference]: Start difference. First operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 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 776 states. [2022-04-15 01:06:44,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:44,684 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2022-04-15 01:06:44,685 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1068 transitions. [2022-04-15 01:06:44,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:44,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:44,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:06:44,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:06:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 586 states have (on average 1.4215017064846416) internal successors, (833), 586 states have internal predecessors, (833), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 837 transitions. [2022-04-15 01:06:44,702 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 837 transitions. Word has length 33 [2022-04-15 01:06:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:06:44,702 INFO L478 AbstractCegarLoop]: Abstraction has 591 states and 837 transitions. [2022-04-15 01:06:44,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 22 states have internal predecessors, (47), 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-15 01:06:44,702 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 837 transitions. [2022-04-15 01:06:44,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 01:06:44,703 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:06:44,703 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:06:44,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 01:06:44,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:44,903 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:06:44,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:06:44,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2125865319, now seen corresponding path program 7 times [2022-04-15 01:06:44,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:06:44,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358967034] [2022-04-15 01:06:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:06:44,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:06:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:45,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:06:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:45,379 INFO L290 TraceCheckUtils]: 0: Hoare triple {33783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {33765#true} is VALID [2022-04-15 01:06:45,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {33765#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:45,379 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33765#true} {33765#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:45,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {33765#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:06:45,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {33783#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {33765#true} is VALID [2022-04-15 01:06:45,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {33765#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:45,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33765#true} {33765#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:45,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {33765#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:45,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {33765#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 01:06:45,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:06:45,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33772#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-15 01:06:45,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {33772#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33773#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} is VALID [2022-04-15 01:06:45,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {33773#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {33774#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-15 01:06:45,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {33774#(and (<= main_~y~0 3) (<= main_~n~0 (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {33775#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} is VALID [2022-04-15 01:06:45,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {33775#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~n~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:45,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:45,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:45,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:45,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,394 INFO L290 TraceCheckUtils]: 21: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:45,396 INFO L290 TraceCheckUtils]: 24: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:45,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:45,398 INFO L290 TraceCheckUtils]: 28: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:45,399 INFO L290 TraceCheckUtils]: 29: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,400 INFO L290 TraceCheckUtils]: 30: Hoare triple {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:45,401 INFO L272 TraceCheckUtils]: 31: Hoare triple {33780#(and (<= (div main_~z~0 4294967296) 0) (< (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296)) (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~z~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296))))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {33781#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 01:06:45,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {33781#(not (= |__VERIFIER_assert_#in~cond| 0))} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33782#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 01:06:45,401 INFO L290 TraceCheckUtils]: 33: Hoare triple {33782#(not (= __VERIFIER_assert_~cond 0))} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {33766#false} is VALID [2022-04-15 01:06:45,401 INFO L290 TraceCheckUtils]: 34: Hoare triple {33766#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33766#false} is VALID [2022-04-15 01:06:45,401 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:06:45,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:06:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358967034] [2022-04-15 01:06:45,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358967034] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:06:45,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836779434] [2022-04-15 01:06:45,402 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-15 01:06:45,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:45,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:06:45,403 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:06:45,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 01:06:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:45,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 01:06:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:45,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:06:49,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {33765#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:49,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {33765#true} [99] 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) 10) (= (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] {33765#true} is VALID [2022-04-15 01:06:49,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {33765#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:49,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33765#true} {33765#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:49,323 INFO L272 TraceCheckUtils]: 4: Hoare triple {33765#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:49,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {33765#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 01:06:49,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {33770#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:06:49,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {33771#(and (<= main_~x~0 (+ 4294967294 (* (div (+ main_~y~0 main_~x~0 (* 4294967296 (div main_~x~0 4294967296)) (* (- 1) main_~n~0)) 4294967296) 4294967296))) (<= (+ main_~x~0 1) main_~n~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33808#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} is VALID [2022-04-15 01:06:49,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {33808#(and (<= (+ main_~x~0 2) main_~n~0) (<= main_~y~0 2) (<= main_~x~0 (+ (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 1) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967293)))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33812#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {33812#(and (<= main_~y~0 3) (<= (+ main_~x~0 3) main_~n~0) (<= main_~x~0 (+ 4294967292 (* (div (+ main_~y~0 main_~x~0 (* (div (+ main_~x~0 2) 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296))))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {33816#(and (<= main_~y~0 3) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3)) 4294967296)))} is VALID [2022-04-15 01:06:49,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {33816#(and (<= main_~y~0 3) (<= (div (+ main_~y~0 (* (- 1) main_~n~0)) (- 4294967296)) (div (+ main_~n~0 (- 3)) 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:49,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:49,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:49,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:49,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,362 INFO L290 TraceCheckUtils]: 19: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,362 INFO L290 TraceCheckUtils]: 20: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:49,364 INFO L290 TraceCheckUtils]: 24: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:49,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {33778#(and (<= main_~z~0 0) (<= main_~n~0 (+ main_~z~0 3 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} is VALID [2022-04-15 01:06:49,367 INFO L290 TraceCheckUtils]: 28: Hoare triple {33777#(and (<= main_~n~0 (+ main_~z~0 2 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))) (<= main_~z~0 1))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 01:06:49,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {33776#(and (<= main_~z~0 2) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296) 1)))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} is VALID [2022-04-15 01:06:49,370 INFO L272 TraceCheckUtils]: 31: Hoare triple {33779#(and (<= main_~z~0 3) (<= main_~n~0 (+ main_~z~0 (* (div (+ main_~n~0 (- 3)) 4294967296) 4294967296))))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:06:49,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:06:49,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {33887#(<= 1 __VERIFIER_assert_~cond)} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {33766#false} is VALID [2022-04-15 01:06:49,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {33766#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33766#false} is VALID [2022-04-15 01:06:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:06:49,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:06:50,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {33766#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33766#false} is VALID [2022-04-15 01:06:50,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {33887#(<= 1 __VERIFIER_assert_~cond)} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {33766#false} is VALID [2022-04-15 01:06:50,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {33887#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 01:06:50,207 INFO L272 TraceCheckUtils]: 31: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {33883#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 01:06:50,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,210 INFO L290 TraceCheckUtils]: 28: Hoare triple {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-15 01:06:50,210 INFO L290 TraceCheckUtils]: 27: Hoare triple {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 01:06:50,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 01:06:50,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 01:06:50,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 01:06:50,214 INFO L290 TraceCheckUtils]: 23: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-15 01:06:50,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-15 01:06:50,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 01:06:50,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 01:06:50,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33918#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 3) 4294967296))} is VALID [2022-04-15 01:06:50,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33914#(= (mod main_~n~0 4294967296) (mod (+ main_~z~0 2) 4294967296))} is VALID [2022-04-15 01:06:50,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {33910#(= (mod (+ main_~z~0 1) 4294967296) (mod main_~n~0 4294967296))} is VALID [2022-04-15 01:06:50,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {33970#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {33903#(= (mod main_~n~0 4294967296) (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:06:50,222 INFO L290 TraceCheckUtils]: 9: Hoare triple {33974#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {33970#(= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:06:50,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {33978#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33974#(or (< 0 (mod main_~x~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~y~0 4294967296)))} is VALID [2022-04-15 01:06:50,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {33982#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33978#(or (< 0 (mod (+ main_~x~0 4294967295) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 1) 4294967296)))} is VALID [2022-04-15 01:06:50,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {33986#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33982#(or (< 0 (mod (+ main_~x~0 4294967294) 4294967296)) (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 2) 4294967296)))} is VALID [2022-04-15 01:06:50,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {33765#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {33986#(or (= (mod main_~n~0 4294967296) (mod (+ main_~y~0 3) 4294967296)) (< 0 (mod (+ main_~x~0 4294967293) 4294967296)))} is VALID [2022-04-15 01:06:50,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {33765#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:50,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33765#true} {33765#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:50,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {33765#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:50,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {33765#true} [99] 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) 10) (= (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] {33765#true} is VALID [2022-04-15 01:06:50,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {33765#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33765#true} is VALID [2022-04-15 01:06:50,227 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 01:06:50,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836779434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:06:50,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:06:50,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 30 [2022-04-15 01:06:50,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383149787] [2022-04-15 01:06:50,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:06:50,228 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 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 35 [2022-04-15 01:06:50,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:06:50,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 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-15 01:06:50,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:50,325 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 01:06:50,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:06:50,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 01:06:50,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2022-04-15 01:06:50,325 INFO L87 Difference]: Start difference. First operand 591 states and 837 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 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-15 01:06:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:57,435 INFO L93 Difference]: Finished difference Result 760 states and 1026 transitions. [2022-04-15 01:06:57,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 01:06:57,435 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 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 35 [2022-04-15 01:06:57,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:06:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 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-15 01:06:57,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-15 01:06:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 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-15 01:06:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-15 01:06:57,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 101 transitions. [2022-04-15 01:06:57,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:57,837 INFO L225 Difference]: With dead ends: 760 [2022-04-15 01:06:57,837 INFO L226 Difference]: Without dead ends: 747 [2022-04-15 01:06:57,838 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1139 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=571, Invalid=4685, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 01:06:57,838 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 01:06:57,838 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 97 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 01:06:57,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-04-15 01:06:58,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 601. [2022-04-15 01:06:58,591 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:06:58,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 747 states. Second operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:58,592 INFO L74 IsIncluded]: Start isIncluded. First operand 747 states. Second operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:58,593 INFO L87 Difference]: Start difference. First operand 747 states. Second operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:58,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:58,608 INFO L93 Difference]: Finished difference Result 747 states and 1012 transitions. [2022-04-15 01:06:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1012 transitions. [2022-04-15 01:06:58,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:58,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:58,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 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 747 states. [2022-04-15 01:06:58,609 INFO L87 Difference]: Start difference. First operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 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 747 states. [2022-04-15 01:06:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:06:58,624 INFO L93 Difference]: Finished difference Result 747 states and 1012 transitions. [2022-04-15 01:06:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1012 transitions. [2022-04-15 01:06:58,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:06:58,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:06:58,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:06:58,625 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:06:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 596 states have (on average 1.4144295302013423) internal successors, (843), 596 states have internal predecessors, (843), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:06:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 847 transitions. [2022-04-15 01:06:58,636 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 847 transitions. Word has length 35 [2022-04-15 01:06:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:06:58,636 INFO L478 AbstractCegarLoop]: Abstraction has 601 states and 847 transitions. [2022-04-15 01:06:58,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 27 states have internal predecessors, (63), 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-15 01:06:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 847 transitions. [2022-04-15 01:06:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 01:06:58,637 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:06:58,637 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:06:58,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 01:06:58,852 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:58,853 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:06:58,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:06:58,853 INFO L85 PathProgramCache]: Analyzing trace with hash -269451439, now seen corresponding path program 6 times [2022-04-15 01:06:58,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:06:58,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808133468] [2022-04-15 01:06:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:06:58,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:06:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:06:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:59,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {37192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {37172#true} is VALID [2022-04-15 01:06:59,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {37172#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37172#true} {37172#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {37172#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:06:59,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {37192#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {37172#true} is VALID [2022-04-15 01:06:59,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {37172#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37172#true} {37172#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {37172#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {37172#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {37177#(= main_~y~0 0)} is VALID [2022-04-15 01:06:59,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {37177#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37178#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:06:59,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {37178#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37179#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:06:59,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {37179#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37180#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:06:59,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {37180#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37181#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:06:59,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {37181#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37182#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:06:59,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {37182#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:06:59,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:06:59,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {37183#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {37184#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 01:06:59,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {37184#(and (<= main_~z~0 6) (<= 6 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37185#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 01:06:59,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {37185#(and (<= main_~z~0 5) (<= 5 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37186#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:06:59,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {37186#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37187#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:06:59,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {37187#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37188#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:06:59,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {37188#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:06:59,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {37189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:06:59,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {37190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {37190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:06:59,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {37190#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:06:59,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {37189#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37188#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:06:59,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {37188#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37187#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:06:59,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {37187#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37186#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:06:59,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {37186#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37185#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 01:06:59,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {37185#(and (<= main_~z~0 5) (<= 5 main_~z~0))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-15 01:06:59,132 INFO L290 TraceCheckUtils]: 27: Hoare triple {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-15 01:06:59,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} is VALID [2022-04-15 01:06:59,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {37191#(and (<= (div main_~z~0 4294967296) 0) (<= 6 main_~z~0))} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {37173#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,133 INFO L272 TraceCheckUtils]: 31: Hoare triple {37173#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {37173#false} is VALID [2022-04-15 01:06:59,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {37173#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37173#false} is VALID [2022-04-15 01:06:59,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {37173#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {37173#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 63 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 01:06:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:06:59,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808133468] [2022-04-15 01:06:59,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808133468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:06:59,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695466173] [2022-04-15 01:06:59,134 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 01:06:59,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:06:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:06:59,134 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:06:59,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 01:06:59,194 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 01:06:59,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:06:59,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 01:06:59,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:06:59,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:06:59,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {37172#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {37172#true} [99] 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) 10) (= (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] {37172#true} is VALID [2022-04-15 01:06:59,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {37172#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,443 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37172#true} {37172#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,443 INFO L272 TraceCheckUtils]: 4: Hoare triple {37172#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,443 INFO L290 TraceCheckUtils]: 5: Hoare triple {37172#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {37172#true} is VALID [2022-04-15 01:06:59,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:59,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:59,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:59,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:59,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:59,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 01:06:59,455 INFO L290 TraceCheckUtils]: 12: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 01:06:59,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 01:06:59,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:59,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:59,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:59,459 INFO L290 TraceCheckUtils]: 17: Hoare triple {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:59,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:59,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,461 INFO L290 TraceCheckUtils]: 22: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,461 INFO L290 TraceCheckUtils]: 23: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,462 INFO L290 TraceCheckUtils]: 26: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,463 INFO L290 TraceCheckUtils]: 27: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,463 INFO L290 TraceCheckUtils]: 28: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {37173#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,463 INFO L290 TraceCheckUtils]: 30: Hoare triple {37173#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,463 INFO L272 TraceCheckUtils]: 31: Hoare triple {37173#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {37173#false} is VALID [2022-04-15 01:06:59,463 INFO L290 TraceCheckUtils]: 32: Hoare triple {37173#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37173#false} is VALID [2022-04-15 01:06:59,463 INFO L290 TraceCheckUtils]: 33: Hoare triple {37173#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {37173#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,464 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 01:06:59,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:06:59,620 INFO L290 TraceCheckUtils]: 34: Hoare triple {37173#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {37173#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {37173#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {37173#false} is VALID [2022-04-15 01:06:59,620 INFO L272 TraceCheckUtils]: 31: Hoare triple {37173#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {37173#false} is VALID [2022-04-15 01:06:59,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {37173#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {37173#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {37173#false} is VALID [2022-04-15 01:06:59,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {37259#(< 0 (mod main_~x~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37259#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:06:59,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:59,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:59,626 INFO L290 TraceCheckUtils]: 16: Hoare triple {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:59,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:59,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:59,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 01:06:59,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 01:06:59,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37234#(< 0 (mod (+ main_~x~0 6) 4294967296))} is VALID [2022-04-15 01:06:59,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37230#(< 0 (mod (+ 5 main_~x~0) 4294967296))} is VALID [2022-04-15 01:06:59,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37226#(< 0 (mod (+ main_~x~0 4) 4294967296))} is VALID [2022-04-15 01:06:59,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37222#(< 0 (mod (+ main_~x~0 3) 4294967296))} is VALID [2022-04-15 01:06:59,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37218#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:06:59,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37214#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:06:59,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {37172#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {37172#true} is VALID [2022-04-15 01:06:59,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {37172#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37172#true} {37172#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {37172#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {37172#true} [99] 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) 10) (= (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] {37172#true} is VALID [2022-04-15 01:06:59,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {37172#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37172#true} is VALID [2022-04-15 01:06:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-15 01:06:59,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695466173] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:06:59,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:06:59,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 9, 9] total 25 [2022-04-15 01:06:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062609328] [2022-04-15 01:06:59,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:06:59,635 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 35 [2022-04-15 01:06:59,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:06:59,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-15 01:06:59,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:06:59,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 01:06:59,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:06:59,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 01:06:59,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=552, Unknown=0, NotChecked=0, Total=600 [2022-04-15 01:06:59,676 INFO L87 Difference]: Start difference. First operand 601 states and 847 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-15 01:07:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:55,751 INFO L93 Difference]: Finished difference Result 1623 states and 2244 transitions. [2022-04-15 01:07:55,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 257 states. [2022-04-15 01:07:55,751 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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 35 [2022-04-15 01:07:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:07:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-15 01:07:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 636 transitions. [2022-04-15 01:07:55,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-15 01:07:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 636 transitions. [2022-04-15 01:07:55,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 257 states and 636 transitions. [2022-04-15 01:07:57,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 636 edges. 636 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:57,466 INFO L225 Difference]: With dead ends: 1623 [2022-04-15 01:07:57,466 INFO L226 Difference]: Without dead ends: 1526 [2022-04-15 01:07:57,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32189 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=4568, Invalid=72994, Unknown=0, NotChecked=0, Total=77562 [2022-04-15 01:07:57,471 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 573 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3722 mSolverCounterSat, 1104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 4826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1104 IncrementalHoareTripleChecker+Valid, 3722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-04-15 01:07:57,471 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [573 Valid, 142 Invalid, 4826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1104 Valid, 3722 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2022-04-15 01:07:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2022-04-15 01:07:58,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 655. [2022-04-15 01:07:58,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:07:58,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1526 states. Second operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:58,406 INFO L74 IsIncluded]: Start isIncluded. First operand 1526 states. Second operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:58,406 INFO L87 Difference]: Start difference. First operand 1526 states. Second operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:58,463 INFO L93 Difference]: Finished difference Result 1526 states and 1997 transitions. [2022-04-15 01:07:58,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1997 transitions. [2022-04-15 01:07:58,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:58,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:58,465 INFO L74 IsIncluded]: Start isIncluded. First operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 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 1526 states. [2022-04-15 01:07:58,465 INFO L87 Difference]: Start difference. First operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 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 1526 states. [2022-04-15 01:07:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:07:58,527 INFO L93 Difference]: Finished difference Result 1526 states and 1997 transitions. [2022-04-15 01:07:58,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1997 transitions. [2022-04-15 01:07:58,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:07:58,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:07:58,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:07:58,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:07:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 650 states have (on average 1.4230769230769231) internal successors, (925), 650 states have internal predecessors, (925), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:07:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 929 transitions. [2022-04-15 01:07:58,547 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 929 transitions. Word has length 35 [2022-04-15 01:07:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:07:58,547 INFO L478 AbstractCegarLoop]: Abstraction has 655 states and 929 transitions. [2022-04-15 01:07:58,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 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-15 01:07:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 929 transitions. [2022-04-15 01:07:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 01:07:58,548 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:07:58,548 INFO L499 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:07:58,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 01:07:58,756 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:07:58,757 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:07:58,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:07:58,757 INFO L85 PathProgramCache]: Analyzing trace with hash -921578713, now seen corresponding path program 8 times [2022-04-15 01:07:58,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:07:58,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767224828] [2022-04-15 01:07:58,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:07:58,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:07:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:59,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:07:59,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:59,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {43563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {43542#true} is VALID [2022-04-15 01:07:59,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {43542#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43542#true} {43542#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {43542#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:07:59,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {43563#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {43542#true} is VALID [2022-04-15 01:07:59,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {43542#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43542#true} {43542#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {43542#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {43542#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {43547#(= main_~y~0 0)} is VALID [2022-04-15 01:07:59,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {43547#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:07:59,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:07:59,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:07:59,052 INFO L290 TraceCheckUtils]: 9: Hoare triple {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43551#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:07:59,052 INFO L290 TraceCheckUtils]: 10: Hoare triple {43551#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43552#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:07:59,053 INFO L290 TraceCheckUtils]: 11: Hoare triple {43552#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43553#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:07:59,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {43553#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43554#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:07:59,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {43554#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43555#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-15 01:07:59,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {43555#(and (<= main_~y~0 8) (<= 8 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43556#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-15 01:07:59,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {43556#(and (<= 9 main_~y~0) (<= main_~y~0 9))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43557#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-15 01:07:59,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {43557#(and (<= main_~y~0 10) (<= 10 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43558#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:07:59,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {43558#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43559#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-15 01:07:59,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {43559#(and (<= 12 main_~y~0) (<= main_~y~0 12))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-15 01:07:59,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-15 01:07:59,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 01:07:59,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {43562#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {43562#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {43543#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {43543#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {43543#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {43543#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {43543#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {43543#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {43543#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {43543#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L272 TraceCheckUtils]: 31: Hoare triple {43543#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {43543#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {43543#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,059 INFO L290 TraceCheckUtils]: 34: Hoare triple {43543#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,060 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 01:07:59,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:07:59,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767224828] [2022-04-15 01:07:59,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767224828] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:07:59,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864005424] [2022-04-15 01:07:59,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 01:07:59,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:07:59,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:07:59,061 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:07:59,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 01:07:59,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 01:07:59,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:07:59,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 01:07:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:07:59,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:07:59,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {43542#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {43542#true} [99] 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) 10) (= (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] {43542#true} is VALID [2022-04-15 01:07:59,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {43542#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43542#true} {43542#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {43542#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {43542#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {43547#(= main_~y~0 0)} is VALID [2022-04-15 01:07:59,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {43547#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:07:59,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {43548#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:07:59,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {43549#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:07:59,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {43550#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43551#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:07:59,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {43551#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43552#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:07:59,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {43552#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43553#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:07:59,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {43553#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43554#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:07:59,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {43554#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43555#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-15 01:07:59,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {43555#(and (<= main_~y~0 8) (<= 8 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43556#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-15 01:07:59,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {43556#(and (<= 9 main_~y~0) (<= main_~y~0 9))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43557#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-15 01:07:59,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {43557#(and (<= main_~y~0 10) (<= 10 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43558#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:07:59,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {43558#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43559#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-15 01:07:59,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {43559#(and (<= 12 main_~y~0) (<= main_~y~0 12))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-15 01:07:59,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-15 01:07:59,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {43560#(and (<= main_~y~0 13) (<= 13 main_~y~0))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {43561#(and (<= 13 main_~z~0) (<= main_~z~0 13))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {43630#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {43630#(and (<= main_~z~0 12) (<= 12 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {43543#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {43543#false} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {43543#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {43543#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {43543#false} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {43543#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {43543#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {43543#false} is VALID [2022-04-15 01:07:59,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {43543#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,405 INFO L290 TraceCheckUtils]: 29: Hoare triple {43543#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {43543#false} is VALID [2022-04-15 01:07:59,405 INFO L290 TraceCheckUtils]: 30: Hoare triple {43543#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,405 INFO L272 TraceCheckUtils]: 31: Hoare triple {43543#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {43543#false} is VALID [2022-04-15 01:07:59,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {43543#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43543#false} is VALID [2022-04-15 01:07:59,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {43543#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {43543#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,405 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 01:07:59,405 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:07:59,896 INFO L290 TraceCheckUtils]: 34: Hoare triple {43543#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {43543#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,896 INFO L290 TraceCheckUtils]: 32: Hoare triple {43543#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L272 TraceCheckUtils]: 31: Hoare triple {43543#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {43543#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {43543#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {43543#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {43543#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {43543#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 25: Hoare triple {43543#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {43543#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {43543#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {43543#false} is VALID [2022-04-15 01:07:59,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {43706#(< 0 (mod main_~z~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {43543#false} is VALID [2022-04-15 01:07:59,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {43710#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {43706#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:07:59,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {43710#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 01:07:59,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 01:07:59,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {43721#(< 0 (mod main_~y~0 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43714#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 01:07:59,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {43725#(< 0 (mod (+ main_~y~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43721#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:07:59,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {43729#(< 0 (mod (+ main_~y~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43725#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 01:07:59,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {43733#(< 0 (mod (+ main_~y~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43729#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 01:07:59,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {43737#(< 0 (mod (+ main_~y~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43733#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 01:07:59,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {43741#(< 0 (mod (+ 5 main_~y~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43737#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 01:07:59,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {43745#(< 0 (mod (+ main_~y~0 6) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43741#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-15 01:07:59,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {43749#(< 0 (mod (+ 7 main_~y~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43745#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-15 01:07:59,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {43753#(< 0 (mod (+ main_~y~0 8) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43749#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-15 01:07:59,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {43757#(< 0 (mod (+ main_~y~0 9) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43753#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-15 01:07:59,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {43761#(< 0 (mod (+ main_~y~0 10) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43757#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-15 01:07:59,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {43765#(< 0 (mod (+ main_~y~0 11) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43761#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-15 01:07:59,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {43769#(< 0 (mod (+ main_~y~0 12) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43765#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-15 01:07:59,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {43542#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {43769#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-15 01:07:59,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {43542#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43542#true} {43542#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {43542#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {43542#true} [99] 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) 10) (= (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] {43542#true} is VALID [2022-04-15 01:07:59,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {43542#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43542#true} is VALID [2022-04-15 01:07:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 01:07:59,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864005424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:07:59,920 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:07:59,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 01:07:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342305443] [2022-04-15 01:07:59,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:07:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 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 35 [2022-04-15 01:07:59,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:07:59,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 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-15 01:07:59,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:07:59,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 01:07:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:07:59,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 01:07:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=989, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 01:07:59,962 INFO L87 Difference]: Start difference. First operand 655 states and 929 transitions. Second operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 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-15 01:08:16,177 WARN L232 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:08:23,974 WARN L232 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:08:37,485 WARN L232 SmtUtils]: Spent 9.75s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:09:23,633 WARN L232 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:11:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:11:46,730 INFO L93 Difference]: Finished difference Result 1623 states and 2457 transitions. [2022-04-15 01:11:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-04-15 01:11:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 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 35 [2022-04-15 01:11:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:11:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 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-15 01:11:46,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 658 transitions. [2022-04-15 01:11:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 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-15 01:11:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 658 transitions. [2022-04-15 01:11:46,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 658 transitions. [2022-04-15 01:11:58,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 658 edges. 656 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 01:11:59,007 INFO L225 Difference]: With dead ends: 1623 [2022-04-15 01:11:59,007 INFO L226 Difference]: Without dead ends: 1503 [2022-04-15 01:11:59,009 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11901 ImplicationChecksByTransitivity, 182.5s TimeCoverageRelationStatistics Valid=7227, Invalid=23222, Unknown=1, NotChecked=0, Total=30450 [2022-04-15 01:11:59,010 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 1725 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2716 mSolverCounterSat, 1929 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1725 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 4645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1929 IncrementalHoareTripleChecker+Valid, 2716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.9s IncrementalHoareTripleChecker+Time [2022-04-15 01:11:59,010 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1725 Valid, 175 Invalid, 4645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1929 Valid, 2716 Invalid, 0 Unknown, 0 Unchecked, 20.9s Time] [2022-04-15 01:11:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2022-04-15 01:12:00,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 667. [2022-04-15 01:12:00,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:12:00,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1503 states. Second operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:00,005 INFO L74 IsIncluded]: Start isIncluded. First operand 1503 states. Second operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:00,006 INFO L87 Difference]: Start difference. First operand 1503 states. Second operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:00,084 INFO L93 Difference]: Finished difference Result 1503 states and 2073 transitions. [2022-04-15 01:12:00,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2073 transitions. [2022-04-15 01:12:00,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:12:00,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:12:00,087 INFO L74 IsIncluded]: Start isIncluded. First operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 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 1503 states. [2022-04-15 01:12:00,088 INFO L87 Difference]: Start difference. First operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 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 1503 states. [2022-04-15 01:12:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:00,160 INFO L93 Difference]: Finished difference Result 1503 states and 2073 transitions. [2022-04-15 01:12:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2073 transitions. [2022-04-15 01:12:00,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:12:00,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:12:00,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:12:00,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:12:00,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 662 states have (on average 1.460725075528701) internal successors, (967), 662 states have internal predecessors, (967), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 971 transitions. [2022-04-15 01:12:00,175 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 971 transitions. Word has length 35 [2022-04-15 01:12:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:12:00,175 INFO L478 AbstractCegarLoop]: Abstraction has 667 states and 971 transitions. [2022-04-15 01:12:00,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 35 states have internal predecessors, (52), 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-15 01:12:00,175 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 971 transitions. [2022-04-15 01:12:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 01:12:00,176 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:12:00,176 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:12:00,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 01:12:00,377 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 01:12:00,377 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:12:00,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:12:00,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1926089105, now seen corresponding path program 9 times [2022-04-15 01:12:00,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:12:00,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820146121] [2022-04-15 01:12:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:12:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:12:00,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:12:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:00,464 INFO L290 TraceCheckUtils]: 0: Hoare triple {49748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {49739#true} is VALID [2022-04-15 01:12:00,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {49739#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49739#true} {49739#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {49739#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:12:00,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {49748#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {49739#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49739#true} {49739#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {49739#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {49739#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:00,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:00,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {49739#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:00,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:00,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:12:00,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49740#false} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {49740#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {49740#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L272 TraceCheckUtils]: 33: Hoare triple {49740#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L290 TraceCheckUtils]: 34: Hoare triple {49740#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L290 TraceCheckUtils]: 35: Hoare triple {49740#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L290 TraceCheckUtils]: 36: Hoare triple {49740#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,474 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 01:12:00,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:12:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820146121] [2022-04-15 01:12:00,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820146121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:12:00,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076739539] [2022-04-15 01:12:00,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-15 01:12:00,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:12:00,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:12:00,475 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:12:00,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 01:12:00,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-15 01:12:00,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:12:00,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 01:12:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:00,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:12:00,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {49739#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {49739#true} [99] 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) 10) (= (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] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {49739#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49739#true} {49739#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {49739#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {49739#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:00,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:00,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {49739#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:00,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:00,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:12:00,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:00,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:12:00,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {49740#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {49740#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,801 INFO L272 TraceCheckUtils]: 33: Hoare triple {49740#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {49740#false} is VALID [2022-04-15 01:12:00,802 INFO L290 TraceCheckUtils]: 34: Hoare triple {49740#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {49740#false} is VALID [2022-04-15 01:12:00,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {49740#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {49740#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:00,802 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 01:12:00,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:12:01,015 INFO L290 TraceCheckUtils]: 36: Hoare triple {49740#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:01,015 INFO L290 TraceCheckUtils]: 35: Hoare triple {49740#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:01,015 INFO L290 TraceCheckUtils]: 34: Hoare triple {49740#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {49740#false} is VALID [2022-04-15 01:12:01,015 INFO L272 TraceCheckUtils]: 33: Hoare triple {49740#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {49740#false} is VALID [2022-04-15 01:12:01,015 INFO L290 TraceCheckUtils]: 32: Hoare triple {49740#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 31: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 30: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {49740#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {49740#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 26: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 25: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 24: Hoare triple {49740#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {49740#false} is VALID [2022-04-15 01:12:01,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {49740#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {49740#false} is VALID [2022-04-15 01:12:01,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49740#false} is VALID [2022-04-15 01:12:01,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:01,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:12:01,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49747#(<= main_~x~0 (+ 3 (* (div (+ main_~x~0 (- 3)) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49746#(<= main_~x~0 (+ 2 (* (div (+ (- 2) main_~x~0) 4294967296) 4294967296)))} is VALID [2022-04-15 01:12:01,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {49745#(<= main_~x~0 (+ (* (div (+ (- 1) main_~x~0) 4294967296) 4294967296) 1))} is VALID [2022-04-15 01:12:01,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:01,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {49739#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {49744#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 01:12:01,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {49739#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {49739#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {49739#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49739#true} {49739#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {49739#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {49739#true} [99] 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) 10) (= (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] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {49739#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49739#true} is VALID [2022-04-15 01:12:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 01:12:01,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076739539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:12:01,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:12:01,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-04-15 01:12:01,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136272769] [2022-04-15 01:12:01,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:12:01,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 37 [2022-04-15 01:12:01,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:12:01,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-15 01:12:01,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:12:01,048 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 01:12:01,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:12:01,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 01:12:01,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-15 01:12:01,048 INFO L87 Difference]: Start difference. First operand 667 states and 971 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-15 01:12:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:02,625 INFO L93 Difference]: Finished difference Result 1079 states and 1532 transitions. [2022-04-15 01:12:02,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 01:12:02,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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 37 [2022-04-15 01:12:02,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:12:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-15 01:12:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-15 01:12:02,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-15 01:12:02,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 74 transitions. [2022-04-15 01:12:02,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 74 transitions. [2022-04-15 01:12:02,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:12:02,747 INFO L225 Difference]: With dead ends: 1079 [2022-04-15 01:12:02,747 INFO L226 Difference]: Without dead ends: 887 [2022-04-15 01:12:02,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 01:12:02,748 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 01:12:02,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 67 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 01:12:02,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-04-15 01:12:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 608. [2022-04-15 01:12:03,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:12:03,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 887 states. Second operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:03,777 INFO L74 IsIncluded]: Start isIncluded. First operand 887 states. Second operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:03,778 INFO L87 Difference]: Start difference. First operand 887 states. Second operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:03,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:03,798 INFO L93 Difference]: Finished difference Result 887 states and 1239 transitions. [2022-04-15 01:12:03,798 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1239 transitions. [2022-04-15 01:12:03,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:12:03,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:12:03,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 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 887 states. [2022-04-15 01:12:03,800 INFO L87 Difference]: Start difference. First operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 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 887 states. [2022-04-15 01:12:03,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:03,821 INFO L93 Difference]: Finished difference Result 887 states and 1239 transitions. [2022-04-15 01:12:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1239 transitions. [2022-04-15 01:12:03,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:12:03,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:12:03,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:12:03,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:12:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 603 states have (on average 1.4593698175787728) internal successors, (880), 603 states have internal predecessors, (880), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:03,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 884 transitions. [2022-04-15 01:12:03,834 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 884 transitions. Word has length 37 [2022-04-15 01:12:03,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:12:03,834 INFO L478 AbstractCegarLoop]: Abstraction has 608 states and 884 transitions. [2022-04-15 01:12:03,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 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-15 01:12:03,834 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 884 transitions. [2022-04-15 01:12:03,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 01:12:03,835 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:12:03,835 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:12:03,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-15 01:12:04,035 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 01:12:04,035 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:12:04,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:12:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash 925242257, now seen corresponding path program 10 times [2022-04-15 01:12:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:12:04,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970625753] [2022-04-15 01:12:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:12:04,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:12:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:12:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:04,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {53727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {53715#true} is VALID [2022-04-15 01:12:04,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {53715#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53715#true} {53715#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {53715#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:12:04,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {53727#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {53715#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53715#true} {53715#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L272 TraceCheckUtils]: 4: Hoare triple {53715#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {53715#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,199 INFO L290 TraceCheckUtils]: 9: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,199 INFO L290 TraceCheckUtils]: 10: Hoare triple {53715#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 01:12:04,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} is VALID [2022-04-15 01:12:04,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {53720#(<= (* (div (+ main_~x~0 4294967295) 4294967296) 4294967296) main_~x~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53721#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} is VALID [2022-04-15 01:12:04,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {53721#(<= (+ (* (div (+ main_~x~0 4294967294) 4294967296) 4294967296) 1) main_~x~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53722#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 01:12:04,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {53722#(<= (+ 2 (* (div (+ main_~x~0 4294967293) 4294967296) 4294967296)) main_~x~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53723#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} is VALID [2022-04-15 01:12:04,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {53723#(<= (+ 3 (* (div (+ 4294967292 main_~x~0) 4294967296) 4294967296)) main_~x~0)} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 01:12:04,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 01:12:04,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 01:12:04,204 INFO L290 TraceCheckUtils]: 18: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 01:12:04,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 01:12:04,205 INFO L290 TraceCheckUtils]: 20: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 01:12:04,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} is VALID [2022-04-15 01:12:04,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {53724#(<= (+ (* (div (+ 4294967291 main_~x~0) 4294967296) 4294967296) 4) main_~x~0)} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {53725#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:12:04,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {53725#(<= (+ 3 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {53726#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} is VALID [2022-04-15 01:12:04,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {53726#(<= (+ 2 (* 4294967296 (div main_~x~0 4294967296))) main_~x~0)} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {53716#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {53716#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {53716#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {53716#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L272 TraceCheckUtils]: 33: Hoare triple {53716#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {53716#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {53716#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {53716#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-04-15 01:12:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:12:04,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970625753] [2022-04-15 01:12:04,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970625753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:12:04,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920481605] [2022-04-15 01:12:04,209 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 01:12:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:12:04,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:12:04,212 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:12:04,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 01:12:04,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 01:12:04,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:12:04,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 01:12:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:04,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:12:04,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {53715#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {53715#true} [99] 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) 10) (= (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] {53715#true} is VALID [2022-04-15 01:12:04,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {53715#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53715#true} {53715#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {53715#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {53715#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {53715#true} is VALID [2022-04-15 01:12:04,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:12:04,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:12:04,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:12:04,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:12:04,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:12:04,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:12:04,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 01:12:04,449 INFO L290 TraceCheckUtils]: 15: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 23: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {53716#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {53716#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 31: Hoare triple {53716#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {53716#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L272 TraceCheckUtils]: 33: Hoare triple {53716#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {53716#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {53716#false} is VALID [2022-04-15 01:12:04,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {53716#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {53716#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 01:12:04,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 36: Hoare triple {53716#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 35: Hoare triple {53716#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {53716#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L272 TraceCheckUtils]: 33: Hoare triple {53716#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {53716#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {53716#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {53716#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {53716#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 28: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 27: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {53716#false} [118] L41-1-->L41-1: Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] {53716#false} is VALID [2022-04-15 01:12:04,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {53716#false} is VALID [2022-04-15 01:12:04,558 INFO L290 TraceCheckUtils]: 23: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:12:04,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 01:12:04,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53780#(< 0 (mod (+ main_~x~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:04,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {53772#(< 0 (mod main_~x~0 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53776#(< 0 (mod (+ main_~x~0 4294967295) 4294967296))} is VALID [2022-04-15 01:12:04,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53772#(< 0 (mod main_~x~0 4294967296))} is VALID [2022-04-15 01:12:04,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:12:04,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:12:04,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:12:04,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53759#(< 0 (mod (+ main_~x~0 2) 4294967296))} is VALID [2022-04-15 01:12:04,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53755#(< 0 (mod (+ main_~x~0 1) 4294967296))} is VALID [2022-04-15 01:12:04,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {53715#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {53715#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L272 TraceCheckUtils]: 4: Hoare triple {53715#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53715#true} {53715#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {53715#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {53715#true} [99] 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) 10) (= (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] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L272 TraceCheckUtils]: 0: Hoare triple {53715#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53715#true} is VALID [2022-04-15 01:12:04,567 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 01:12:04,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920481605] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:12:04,567 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:12:04,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 15 [2022-04-15 01:12:04,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607287290] [2022-04-15 01:12:04,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:12:04,568 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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 37 [2022-04-15 01:12:04,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:12:04,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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-15 01:12:04,603 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-15 01:12:04,603 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 01:12:04,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:12:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 01:12:04,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2022-04-15 01:12:04,604 INFO L87 Difference]: Start difference. First operand 608 states and 884 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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-15 01:12:07,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:07,526 INFO L93 Difference]: Finished difference Result 1380 states and 2003 transitions. [2022-04-15 01:12:07,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 01:12:07,526 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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 37 [2022-04-15 01:12:07,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:12:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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-15 01:12:07,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 153 transitions. [2022-04-15 01:12:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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-15 01:12:07,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 153 transitions. [2022-04-15 01:12:07,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 153 transitions. [2022-04-15 01:12:07,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:12:07,757 INFO L225 Difference]: With dead ends: 1380 [2022-04-15 01:12:07,757 INFO L226 Difference]: Without dead ends: 1175 [2022-04-15 01:12:07,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=245, Invalid=685, Unknown=0, NotChecked=0, Total=930 [2022-04-15 01:12:07,758 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 287 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 01:12:07,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 73 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 01:12:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-04-15 01:12:08,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 660. [2022-04-15 01:12:08,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:12:08,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1175 states. Second operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:08,935 INFO L74 IsIncluded]: Start isIncluded. First operand 1175 states. Second operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:08,936 INFO L87 Difference]: Start difference. First operand 1175 states. Second operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:08,974 INFO L93 Difference]: Finished difference Result 1175 states and 1668 transitions. [2022-04-15 01:12:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1668 transitions. [2022-04-15 01:12:08,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:12:08,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:12:08,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 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 1175 states. [2022-04-15 01:12:08,976 INFO L87 Difference]: Start difference. First operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 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 1175 states. [2022-04-15 01:12:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:12:09,013 INFO L93 Difference]: Finished difference Result 1175 states and 1668 transitions. [2022-04-15 01:12:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1668 transitions. [2022-04-15 01:12:09,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:12:09,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:12:09,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:12:09,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:12:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 655 states have (on average 1.451908396946565) internal successors, (951), 655 states have internal predecessors, (951), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:12:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 955 transitions. [2022-04-15 01:12:09,029 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 955 transitions. Word has length 37 [2022-04-15 01:12:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:12:09,029 INFO L478 AbstractCegarLoop]: Abstraction has 660 states and 955 transitions. [2022-04-15 01:12:09,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 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-15 01:12:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 955 transitions. [2022-04-15 01:12:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 01:12:09,030 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:12:09,030 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:12:09,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 01:12:09,230 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:12:09,231 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:12:09,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:12:09,231 INFO L85 PathProgramCache]: Analyzing trace with hash 165866806, now seen corresponding path program 7 times [2022-04-15 01:12:09,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:12:09,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538558590] [2022-04-15 01:12:09,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:12:09,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:12:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:12:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:09,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {58737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {58716#true} is VALID [2022-04-15 01:12:09,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {58716#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58716#true} {58716#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {58716#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:12:09,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {58737#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {58716#true} is VALID [2022-04-15 01:12:09,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {58716#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58716#true} {58716#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {58716#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {58716#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {58721#(= main_~y~0 0)} is VALID [2022-04-15 01:12:09,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {58721#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:12:09,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:12:09,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:12:09,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:12:09,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {58725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:12:09,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {58726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:12:09,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {58727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {58729#(and (<= main_~z~0 7) (<= 7 main_~z~0))} is VALID [2022-04-15 01:12:09,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {58729#(and (<= main_~z~0 7) (<= 7 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58730#(and (<= main_~z~0 6) (<= 6 main_~z~0))} is VALID [2022-04-15 01:12:09,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {58730#(and (<= main_~z~0 6) (<= 6 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58731#(and (<= main_~z~0 5) (<= 5 main_~z~0))} is VALID [2022-04-15 01:12:09,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {58731#(and (<= main_~z~0 5) (<= 5 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58732#(and (<= 4 main_~z~0) (<= main_~z~0 4))} is VALID [2022-04-15 01:12:09,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {58732#(and (<= 4 main_~z~0) (<= main_~z~0 4))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58733#(and (<= main_~z~0 3) (<= 3 main_~z~0))} is VALID [2022-04-15 01:12:09,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {58733#(and (<= main_~z~0 3) (<= 3 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58734#(and (<= main_~z~0 2) (<= 2 main_~z~0))} is VALID [2022-04-15 01:12:09,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {58734#(and (<= main_~z~0 2) (<= 2 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58735#(and (<= main_~z~0 1) (<= 1 main_~z~0))} is VALID [2022-04-15 01:12:09,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {58735#(and (<= main_~z~0 1) (<= 1 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58736#(and (<= main_~z~0 0) (<= 0 main_~z~0))} is VALID [2022-04-15 01:12:09,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {58736#(and (<= main_~z~0 0) (<= 0 main_~z~0))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58717#false} is VALID [2022-04-15 01:12:09,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {58717#false} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 27: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 28: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 29: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 30: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 31: Hoare triple {58717#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {58717#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 33: Hoare triple {58717#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 34: Hoare triple {58717#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L272 TraceCheckUtils]: 35: Hoare triple {58717#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {58717#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {58717#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,506 INFO L290 TraceCheckUtils]: 38: Hoare triple {58717#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,507 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 01:12:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:12:09,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538558590] [2022-04-15 01:12:09,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538558590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:12:09,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912148658] [2022-04-15 01:12:09,507 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-04-15 01:12:09,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:12:09,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:12:09,508 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:12:09,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 01:12:09,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:09,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 01:12:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:12:09,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:12:09,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {58716#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {58716#true} [99] 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) 10) (= (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] {58716#true} is VALID [2022-04-15 01:12:09,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {58716#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58716#true} {58716#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {58716#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:09,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {58716#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {58721#(= main_~y~0 0)} is VALID [2022-04-15 01:12:09,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {58721#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:12:09,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {58722#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:12:09,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {58723#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:12:09,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {58724#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:12:09,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {58725#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:12:09,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {58726#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:12:09,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {58727#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {58728#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {58783#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {58783#(and (= main_~z~0 main_~y~0) (<= 7 main_~y~0) (<= main_~y~0 7))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58787#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} is VALID [2022-04-15 01:12:09,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {58787#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= main_~y~0 (+ main_~z~0 1)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58791#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} is VALID [2022-04-15 01:12:09,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {58791#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~z~0 1) (+ (- 1) main_~y~0)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58795#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {58795#(and (= (+ (- 2) main_~y~0) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58799#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {58799#(and (= (+ main_~y~0 (- 3)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58803#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} is VALID [2022-04-15 01:12:09,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {58803#(and (<= 7 main_~y~0) (<= main_~y~0 7) (= (+ main_~y~0 (- 3)) (+ main_~z~0 2)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58807#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {58807#(and (= (+ main_~y~0 (- 5)) (+ main_~z~0 1)) (<= 7 main_~y~0) (<= main_~y~0 7))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58811#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {58811#(and (= (+ main_~z~0 2) (+ main_~y~0 (- 5))) (<= 7 main_~y~0) (<= main_~y~0 7))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {58717#false} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {58717#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {58717#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {58717#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 33: Hoare triple {58717#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {58717#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,975 INFO L272 TraceCheckUtils]: 35: Hoare triple {58717#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {58717#false} is VALID [2022-04-15 01:12:09,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {58717#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {58717#false} is VALID [2022-04-15 01:12:09,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {58717#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {58717#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 01:12:09,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:12:10,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {58717#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:10,547 INFO L290 TraceCheckUtils]: 37: Hoare triple {58717#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:10,547 INFO L290 TraceCheckUtils]: 36: Hoare triple {58717#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {58717#false} is VALID [2022-04-15 01:12:10,548 INFO L272 TraceCheckUtils]: 35: Hoare triple {58717#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {58717#false} is VALID [2022-04-15 01:12:10,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {58717#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:10,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {58717#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:10,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {58717#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:10,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {58884#(< 0 (mod main_~y~0 4294967296))} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {58717#false} is VALID [2022-04-15 01:12:10,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {58888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58884#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:12:10,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {58892#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58888#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 01:12:10,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {58896#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58892#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 01:12:10,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {58900#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58896#(< 0 (mod (+ main_~y~0 4294967293) 4294967296))} is VALID [2022-04-15 01:12:10,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {58904#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58900#(< 0 (mod (+ 4294967292 main_~y~0) 4294967296))} is VALID [2022-04-15 01:12:10,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {58908#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58904#(< 0 (mod (+ 4294967291 main_~y~0) 4294967296))} is VALID [2022-04-15 01:12:10,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {58908#(< 0 (mod (+ 4294967290 main_~y~0) 4294967296))} is VALID [2022-04-15 01:12:10,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-15 01:12:10,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {58919#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58912#(< 0 (mod (+ main_~y~0 4294967289) 4294967296))} is VALID [2022-04-15 01:12:10,557 INFO L290 TraceCheckUtils]: 21: Hoare triple {58923#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58919#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod main_~z~0 4294967296))))} is VALID [2022-04-15 01:12:10,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {58927#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58923#(or (not (< 0 (mod (+ main_~z~0 4294967295) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-15 01:12:10,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {58931#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58927#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967294) 4294967296))))} is VALID [2022-04-15 01:12:10,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {58935#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58931#(or (not (< 0 (mod (+ main_~z~0 4294967293) 4294967296))) (< 0 (mod (+ main_~y~0 4294967289) 4294967296)))} is VALID [2022-04-15 01:12:10,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {58939#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58935#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967292 main_~z~0) 4294967296))))} is VALID [2022-04-15 01:12:10,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {58943#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58939#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967291 main_~z~0) 4294967296))))} is VALID [2022-04-15 01:12:10,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {58947#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {58943#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ 4294967290 main_~z~0) 4294967296))))} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {58716#true} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {58947#(or (< 0 (mod (+ main_~y~0 4294967289) 4294967296)) (not (< 0 (mod (+ main_~z~0 4294967289) 4294967296))))} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {58716#true} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {58716#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 11: Hoare triple {58716#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 10: Hoare triple {58716#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {58716#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {58716#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {58716#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {58716#true} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {58716#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {58716#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58716#true} {58716#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:10,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {58716#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:10,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {58716#true} [99] 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) 10) (= (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] {58716#true} is VALID [2022-04-15 01:12:10,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {58716#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {58716#true} is VALID [2022-04-15 01:12:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 01:12:10,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912148658] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:12:10,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:12:10,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 43 [2022-04-15 01:12:10,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310481248] [2022-04-15 01:12:10,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:12:10,564 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 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 39 [2022-04-15 01:12:10,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:12:10,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 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-15 01:12:10,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:12:10,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 01:12:10,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:12:10,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 01:12:10,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1515, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 01:12:10,612 INFO L87 Difference]: Start difference. First operand 660 states and 955 transitions. Second operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 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-15 01:13:04,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:13:04,624 INFO L93 Difference]: Finished difference Result 1590 states and 2257 transitions. [2022-04-15 01:13:04,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2022-04-15 01:13:04,624 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 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 39 [2022-04-15 01:13:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 01:13:04,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 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-15 01:13:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 726 transitions. [2022-04-15 01:13:04,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 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-15 01:13:04,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 726 transitions. [2022-04-15 01:13:04,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 726 transitions. [2022-04-15 01:13:06,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 726 edges. 726 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 01:13:06,830 INFO L225 Difference]: With dead ends: 1590 [2022-04-15 01:13:06,830 INFO L226 Difference]: Without dead ends: 1441 [2022-04-15 01:13:06,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24817 ImplicationChecksByTransitivity, 21.0s TimeCoverageRelationStatistics Valid=7979, Invalid=55777, Unknown=0, NotChecked=0, Total=63756 [2022-04-15 01:13:06,834 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 680 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4214 mSolverCounterSat, 1325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 5539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1325 IncrementalHoareTripleChecker+Valid, 4214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2022-04-15 01:13:06,834 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 152 Invalid, 5539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1325 Valid, 4214 Invalid, 0 Unknown, 0 Unchecked, 15.8s Time] [2022-04-15 01:13:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2022-04-15 01:13:08,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 935. [2022-04-15 01:13:08,461 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 01:13:08,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1441 states. Second operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:13:08,463 INFO L74 IsIncluded]: Start isIncluded. First operand 1441 states. Second operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:13:08,464 INFO L87 Difference]: Start difference. First operand 1441 states. Second operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:13:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:13:08,526 INFO L93 Difference]: Finished difference Result 1441 states and 1895 transitions. [2022-04-15 01:13:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1895 transitions. [2022-04-15 01:13:08,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:13:08,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:13:08,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 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 1441 states. [2022-04-15 01:13:08,529 INFO L87 Difference]: Start difference. First operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 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 1441 states. [2022-04-15 01:13:08,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 01:13:08,578 INFO L93 Difference]: Finished difference Result 1441 states and 1895 transitions. [2022-04-15 01:13:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 1441 states and 1895 transitions. [2022-04-15 01:13:08,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 01:13:08,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 01:13:08,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 01:13:08,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 01:13:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 930 states have (on average 1.4645161290322581) internal successors, (1362), 930 states have internal predecessors, (1362), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 01:13:08,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1366 transitions. [2022-04-15 01:13:08,615 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1366 transitions. Word has length 39 [2022-04-15 01:13:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 01:13:08,615 INFO L478 AbstractCegarLoop]: Abstraction has 935 states and 1366 transitions. [2022-04-15 01:13:08,615 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.3953488372093024) internal successors, (60), 42 states have internal predecessors, (60), 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-15 01:13:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1366 transitions. [2022-04-15 01:13:08,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 01:13:08,616 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 01:13:08,616 INFO L499 BasicCegarLoop]: trace histogram [14, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 01:13:08,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 01:13:08,816 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:13:08,817 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 01:13:08,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 01:13:08,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1352634705, now seen corresponding path program 4 times [2022-04-15 01:13:08,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 01:13:08,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484810992] [2022-04-15 01:13:08,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 01:13:08,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 01:13:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:13:09,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 01:13:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:13:09,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {65229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {65206#true} is VALID [2022-04-15 01:13:09,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {65206#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65206#true} {65206#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {65206#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 01:13:09,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {65229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [99] 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) 10) (= (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] {65206#true} is VALID [2022-04-15 01:13:09,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {65206#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65206#true} {65206#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {65206#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {65206#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {65211#(= main_~y~0 0)} is VALID [2022-04-15 01:13:09,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {65211#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:13:09,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:13:09,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:13:09,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65215#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:13:09,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {65215#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65216#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:13:09,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {65216#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65217#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:13:09,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {65217#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65218#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:13:09,188 INFO L290 TraceCheckUtils]: 13: Hoare triple {65218#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65219#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-15 01:13:09,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {65219#(and (<= main_~y~0 8) (<= 8 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65220#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-15 01:13:09,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {65220#(and (<= 9 main_~y~0) (<= main_~y~0 9))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65221#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-15 01:13:09,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {65221#(and (<= main_~y~0 10) (<= 10 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65222#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:13:09,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {65222#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65223#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-15 01:13:09,191 INFO L290 TraceCheckUtils]: 18: Hoare triple {65223#(and (<= 12 main_~y~0) (<= main_~y~0 12))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65224#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-15 01:13:09,192 INFO L290 TraceCheckUtils]: 19: Hoare triple {65224#(and (<= main_~y~0 13) (<= 13 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-15 01:13:09,192 INFO L290 TraceCheckUtils]: 20: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-15 01:13:09,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 01:13:09,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 01:13:09,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {65228#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} is VALID [2022-04-15 01:13:09,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {65228#(and (<= (div main_~z~0 4294967296) 0) (<= 12 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {65207#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {65207#false} is VALID [2022-04-15 01:13:09,194 INFO L290 TraceCheckUtils]: 26: Hoare triple {65207#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {65207#false} is VALID [2022-04-15 01:13:09,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {65207#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {65207#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {65207#false} is VALID [2022-04-15 01:13:09,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {65207#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {65207#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {65207#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {65207#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {65207#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 34: Hoare triple {65207#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L272 TraceCheckUtils]: 35: Hoare triple {65207#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {65207#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {65207#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {65207#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 01:13:09,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 01:13:09,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484810992] [2022-04-15 01:13:09,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484810992] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 01:13:09,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815718368] [2022-04-15 01:13:09,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 01:13:09,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 01:13:09,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 01:13:09,196 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 01:13:09,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 01:13:09,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 01:13:09,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 01:13:09,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 01:13:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 01:13:09,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 01:13:09,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {65206#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {65206#true} [99] 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) 10) (= (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] {65206#true} is VALID [2022-04-15 01:13:09,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {65206#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65206#true} {65206#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {65206#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:09,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {65206#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {65211#(= main_~y~0 0)} is VALID [2022-04-15 01:13:09,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {65211#(= main_~y~0 0)} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} is VALID [2022-04-15 01:13:09,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {65212#(and (<= 1 main_~y~0) (<= main_~y~0 1))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} is VALID [2022-04-15 01:13:09,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {65213#(and (<= 2 main_~y~0) (<= main_~y~0 2))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} is VALID [2022-04-15 01:13:09,563 INFO L290 TraceCheckUtils]: 9: Hoare triple {65214#(and (<= main_~y~0 3) (<= 3 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65215#(and (<= main_~y~0 4) (<= 4 main_~y~0))} is VALID [2022-04-15 01:13:09,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {65215#(and (<= main_~y~0 4) (<= 4 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65216#(and (<= 5 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-15 01:13:09,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {65216#(and (<= 5 main_~y~0) (<= main_~y~0 5))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65217#(and (<= main_~y~0 6) (<= 6 main_~y~0))} is VALID [2022-04-15 01:13:09,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {65217#(and (<= main_~y~0 6) (<= 6 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65218#(and (<= 7 main_~y~0) (<= main_~y~0 7))} is VALID [2022-04-15 01:13:09,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {65218#(and (<= 7 main_~y~0) (<= main_~y~0 7))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65219#(and (<= main_~y~0 8) (<= 8 main_~y~0))} is VALID [2022-04-15 01:13:09,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {65219#(and (<= main_~y~0 8) (<= 8 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65220#(and (<= 9 main_~y~0) (<= main_~y~0 9))} is VALID [2022-04-15 01:13:09,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {65220#(and (<= 9 main_~y~0) (<= main_~y~0 9))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65221#(and (<= main_~y~0 10) (<= 10 main_~y~0))} is VALID [2022-04-15 01:13:09,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {65221#(and (<= main_~y~0 10) (<= 10 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65222#(and (<= main_~y~0 11) (<= 11 main_~y~0))} is VALID [2022-04-15 01:13:09,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {65222#(and (<= main_~y~0 11) (<= 11 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65223#(and (<= 12 main_~y~0) (<= main_~y~0 12))} is VALID [2022-04-15 01:13:09,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {65223#(and (<= 12 main_~y~0) (<= main_~y~0 12))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65224#(and (<= main_~y~0 13) (<= 13 main_~y~0))} is VALID [2022-04-15 01:13:09,570 INFO L290 TraceCheckUtils]: 19: Hoare triple {65224#(and (<= main_~y~0 13) (<= 13 main_~y~0))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-15 01:13:09,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} is VALID [2022-04-15 01:13:09,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {65225#(and (<= 14 main_~y~0) (<= main_~y~0 14))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} is VALID [2022-04-15 01:13:09,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {65226#(and (<= 14 main_~z~0) (<= main_~z~0 14))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} is VALID [2022-04-15 01:13:09,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {65227#(and (<= 13 main_~z~0) (<= main_~z~0 13))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {65302#(and (<= main_~z~0 12) (<= 12 main_~z~0))} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {65302#(and (<= main_~z~0 12) (<= 12 main_~z~0))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {65207#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 26: Hoare triple {65207#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 27: Hoare triple {65207#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {65207#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {65207#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {65207#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {65207#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {65207#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 33: Hoare triple {65207#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 34: Hoare triple {65207#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L272 TraceCheckUtils]: 35: Hoare triple {65207#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {65207#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {65207#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,573 INFO L290 TraceCheckUtils]: 38: Hoare triple {65207#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 01:13:09,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 01:13:10,189 INFO L290 TraceCheckUtils]: 38: Hoare triple {65207#false} [128] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:10,189 INFO L290 TraceCheckUtils]: 37: Hoare triple {65207#false} [126] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:10,189 INFO L290 TraceCheckUtils]: 36: Hoare triple {65207#false} [124] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L272 TraceCheckUtils]: 35: Hoare triple {65207#false} [122] L47-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod v_main_~n~0_3 4294967296) (mod v_main_~z~0_14 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~z~0=v_main_~z~0_14, main_~n~0=v_main_~n~0_3} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~z~0, main_~n~0] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {65207#false} [120] L47-1-->L47-2: Formula: (not (< 0 (mod v_main_~y~0_3 4294967296))) InVars {main_~y~0=v_main_~y~0_3} OutVars{main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {65207#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 32: Hoare triple {65207#false} [121] L47-1-->L47-1: Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~y~0=v_main_~y~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 31: Hoare triple {65207#false} [117] L41-1-->L47-1: Formula: (not (< 0 (mod v_main_~z~0_9 4294967296))) InVars {main_~z~0=v_main_~z~0_9} OutVars{main_~z~0=v_main_~z~0_9} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {65207#false} [114] L35-1-->L41-1: Formula: (not (< 0 (mod v_main_~x~0_5 4294967296))) InVars {main_~x~0=v_main_~x~0_5} OutVars{main_~x~0=v_main_~x~0_5} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {65207#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {65207#false} [115] L35-1-->L35-1: Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] {65207#false} is VALID [2022-04-15 01:13:10,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {65207#false} [111] L29-1-->L35-1: Formula: (not (< 0 (mod v_main_~y~0_1 4294967296))) InVars {main_~y~0=v_main_~y~0_1} OutVars{main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:10,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {65207#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {65207#false} is VALID [2022-04-15 01:13:10,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {65207#false} [112] L29-1-->L29-1: Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~y~0=v_main_~y~0_5, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] {65207#false} is VALID [2022-04-15 01:13:10,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {65390#(< 0 (mod main_~z~0 4294967296))} [108] L23-2-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~z~0=v_main_~z~0_8} OutVars{main_~z~0=v_main_~z~0_8} AuxVars[] AssignedVars[] {65207#false} is VALID [2022-04-15 01:13:10,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {65394#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {65390#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 01:13:10,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {65398#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} [109] L23-2-->L23-2: Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {65394#(< 0 (mod (+ main_~z~0 4294967295) 4294967296))} is VALID [2022-04-15 01:13:10,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} [106] L16-3-->L23-2: Formula: (= v_main_~y~0_12 v_main_~z~0_7) InVars {main_~y~0=v_main_~y~0_12} OutVars{main_~y~0=v_main_~y~0_12, main_~z~0=v_main_~z~0_7} AuxVars[] AssignedVars[main_~z~0] {65398#(< 0 (mod (+ main_~z~0 4294967294) 4294967296))} is VALID [2022-04-15 01:13:10,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} [104] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 01:13:10,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {65409#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65402#(< 0 (mod (+ main_~y~0 4294967294) 4294967296))} is VALID [2022-04-15 01:13:10,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {65413#(< 0 (mod main_~y~0 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65409#(< 0 (mod (+ main_~y~0 4294967295) 4294967296))} is VALID [2022-04-15 01:13:10,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {65417#(< 0 (mod (+ main_~y~0 1) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65413#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 01:13:10,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {65421#(< 0 (mod (+ main_~y~0 2) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65417#(< 0 (mod (+ main_~y~0 1) 4294967296))} is VALID [2022-04-15 01:13:10,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {65425#(< 0 (mod (+ main_~y~0 3) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65421#(< 0 (mod (+ main_~y~0 2) 4294967296))} is VALID [2022-04-15 01:13:10,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {65429#(< 0 (mod (+ main_~y~0 4) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65425#(< 0 (mod (+ main_~y~0 3) 4294967296))} is VALID [2022-04-15 01:13:10,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {65433#(< 0 (mod (+ 5 main_~y~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65429#(< 0 (mod (+ main_~y~0 4) 4294967296))} is VALID [2022-04-15 01:13:10,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {65437#(< 0 (mod (+ main_~y~0 6) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65433#(< 0 (mod (+ 5 main_~y~0) 4294967296))} is VALID [2022-04-15 01:13:10,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {65441#(< 0 (mod (+ 7 main_~y~0) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65437#(< 0 (mod (+ main_~y~0 6) 4294967296))} is VALID [2022-04-15 01:13:10,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {65445#(< 0 (mod (+ main_~y~0 8) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65441#(< 0 (mod (+ 7 main_~y~0) 4294967296))} is VALID [2022-04-15 01:13:10,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {65449#(< 0 (mod (+ main_~y~0 9) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65445#(< 0 (mod (+ main_~y~0 8) 4294967296))} is VALID [2022-04-15 01:13:10,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {65453#(< 0 (mod (+ main_~y~0 10) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65449#(< 0 (mod (+ main_~y~0 9) 4294967296))} is VALID [2022-04-15 01:13:10,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {65457#(< 0 (mod (+ main_~y~0 11) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65453#(< 0 (mod (+ main_~y~0 10) 4294967296))} is VALID [2022-04-15 01:13:10,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {65461#(< 0 (mod (+ main_~y~0 12) 4294967296))} [105] L16-2-->L16-2: Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {65457#(< 0 (mod (+ main_~y~0 11) 4294967296))} is VALID [2022-04-15 01:13:10,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {65206#true} [101] mainENTRY-->L16-2: Formula: (and (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|) (= v_main_~y~0_2 0)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_2, main_~n~0=v_main_~n~0_1, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~y~0, main_~n~0] {65461#(< 0 (mod (+ main_~y~0 12) 4294967296))} is VALID [2022-04-15 01:13:10,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {65206#true} [98] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:10,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65206#true} {65206#true} [131] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:10,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {65206#true} [102] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:10,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {65206#true} [99] 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) 10) (= (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] {65206#true} is VALID [2022-04-15 01:13:10,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {65206#true} [97] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {65206#true} is VALID [2022-04-15 01:13:10,206 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 01:13:10,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815718368] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 01:13:10,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 01:13:10,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 01:13:10,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638882125] [2022-04-15 01:13:10,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-15 01:13:10,207 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.375) internal successors, (55), 39 states have internal predecessors, (55), 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 39 [2022-04-15 01:13:10,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 01:13:10,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.375) internal successors, (55), 39 states have internal predecessors, (55), 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-15 01:13:10,258 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-15 01:13:10,258 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 01:13:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 01:13:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 01:13:10,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 01:13:10,259 INFO L87 Difference]: Start difference. First operand 935 states and 1366 transitions. Second operand has 40 states, 40 states have (on average 1.375) internal successors, (55), 39 states have internal predecessors, (55), 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-15 01:13:25,421 WARN L232 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:13:37,507 WARN L232 SmtUtils]: Spent 5.34s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:14:05,814 WARN L232 SmtUtils]: Spent 17.18s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:14:38,294 WARN L232 SmtUtils]: Spent 15.91s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:14:55,397 WARN L232 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:15:13,351 WARN L232 SmtUtils]: Spent 5.78s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:15:29,304 WARN L232 SmtUtils]: Spent 7.76s on a formula simplification that was a NOOP. DAG size: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:15:42,054 WARN L232 SmtUtils]: Spent 7.52s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:16:04,475 WARN L232 SmtUtils]: Spent 6.71s on a formula simplification that was a NOOP. DAG size: 66 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:16:16,858 WARN L232 SmtUtils]: Spent 7.96s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:16:40,834 WARN L232 SmtUtils]: Spent 6.49s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:17:13,338 WARN L232 SmtUtils]: Spent 6.42s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:17:24,195 WARN L232 SmtUtils]: Spent 6.56s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 01:18:00,032 WARN L232 SmtUtils]: Spent 6.54s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)