/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/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:35:11,054 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:35:11,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:35:11,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:35:11,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:35:11,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:35:11,126 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:35:11,127 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:35:11,128 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:35:11,132 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:35:11,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:35:11,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:35:11,134 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:35:11,135 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:35:11,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:35:11,137 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:35:11,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:35:11,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:35:11,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:35:11,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:35:11,144 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:35:11,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:35:11,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:35:11,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:35:11,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:35:11,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:35:11,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:35:11,152 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:35:11,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:35:11,153 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:35:11,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:35:11,154 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:35:11,155 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:35:11,156 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:35:11,156 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:35:11,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:35:11,157 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:35:11,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:35:11,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:35:11,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:35:11,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:35:11,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:35:11,159 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:35:11,168 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:35:11,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:35:11,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:35:11,170 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:35:11,170 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:35:11,170 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:35:11,170 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:35:11,170 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:35:11,170 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:35:11,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:35:11,171 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:35:11,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:35:11,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:35:11,172 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:35:11,173 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:35:11,173 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 16:35:11,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:35:11,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:35:11,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:35:11,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:35:11,368 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:35:11,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-27 16:35:11,411 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81668e093/de833634bce04309b81e7a42c7905f1a/FLAGbb265b9ac [2022-04-27 16:35:11,749 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:35:11,749 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-27 16:35:11,752 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81668e093/de833634bce04309b81e7a42c7905f1a/FLAGbb265b9ac [2022-04-27 16:35:11,760 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81668e093/de833634bce04309b81e7a42c7905f1a [2022-04-27 16:35:11,762 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:35:11,763 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:35:11,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:35:11,764 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:35:11,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:35:11,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23dcfe43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11, skipping insertion in model container [2022-04-27 16:35:11,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:35:11,778 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:35:11,884 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-de20.c[368,381] [2022-04-27 16:35:11,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:35:11,902 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:35:11,908 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-de20.c[368,381] [2022-04-27 16:35:11,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:35:11,920 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:35:11,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11 WrapperNode [2022-04-27 16:35:11,920 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:35:11,921 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:35:11,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:35:11,921 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:35:11,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,934 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:35:11,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:35:11,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:35:11,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:35:11,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (1/1) ... [2022-04-27 16:35:11,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:35:11,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:11,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 16:35:11,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 16:35:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:35:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:35:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:35:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:35:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:35:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:35:12,001 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:35:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:35:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:35:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-27 16:35:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:35:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:35:12,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:35:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:35:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:35:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:35:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:35:12,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:35:12,043 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:35:12,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:35:12,154 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:35:12,159 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:35:12,159 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-27 16:35:12,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:35:12 BoogieIcfgContainer [2022-04-27 16:35:12,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:35:12,162 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:35:12,162 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:35:12,163 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:35:12,165 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:35:12" (1/1) ... [2022-04-27 16:35:12,170 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:35:14,625 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:35:14,626 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~x~0_6 4294967296)) (= v_main_~x~0_6 (+ v_main_~x~0_5 1)) (= v_main_~y~0_2 (+ v_main_~y~0_3 1))) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_3} OutVars{main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_6 4294967296))) (or (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_6 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~x~0_5 v_it_1 1) v_main_~x~0_6)))) (< 0 .cse0) (< v_main_~x~0_5 v_main_~x~0_6) (= v_main_~y~0_2 (+ v_main_~x~0_6 v_main_~y~0_3 (* (- 1) v_main_~x~0_5)))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~y~0_3 v_main_~y~0_2) (= v_main_~x~0_5 v_main_~x~0_6) (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-04-27 16:35:14,895 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-27 16:35:14,896 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~z~0_4 4294967296)) (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (= (+ v_main_~z~0_3 1) v_main_~z~0_4)) InVars {main_~x~0=v_main_~x~0_3, main_~z~0=v_main_~z~0_4} OutVars{main_~x~0=v_main_~x~0_2, main_~z~0=v_main_~z~0_3, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_4 4294967296))) (or (and (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_3 v_main_~z~0_4) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_4 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_3 v_it_2 1) v_main_~z~0_4)) (not (<= 1 v_it_2)))) (< v_main_~z~0_3 v_main_~z~0_4) (= (+ (* (- 1) v_main_~z~0_3) v_main_~x~0_3 v_main_~z~0_4) v_main_~x~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-04-27 16:35:14,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:35:14 BasicIcfg [2022-04-27 16:35:14,899 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:35:14,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:35:14,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:35:14,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:35:14,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:35:11" (1/4) ... [2022-04-27 16:35:14,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33028569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:35:14, skipping insertion in model container [2022-04-27 16:35:14,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:35:11" (2/4) ... [2022-04-27 16:35:14,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33028569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:35:14, skipping insertion in model container [2022-04-27 16:35:14,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:35:12" (3/4) ... [2022-04-27 16:35:14,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33028569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:35:14, skipping insertion in model container [2022-04-27 16:35:14,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:35:14" (4/4) ... [2022-04-27 16:35:14,904 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.cJordan [2022-04-27 16:35:14,913 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:35:14,914 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:35:14,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:35:14,957 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4968f241, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ab2925d [2022-04-27 16:35:14,957 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:35:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:35:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:35:14,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:14,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:14,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:14,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:14,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1032895658, now seen corresponding path program 1 times [2022-04-27 16:35:14,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:14,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201103403] [2022-04-27 16:35:14,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:14,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:15,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:15,094 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {24#true} is VALID [2022-04-27 16:35:15,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:15,095 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:15,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:15,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {24#true} is VALID [2022-04-27 16:35:15,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:15,097 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:15,097 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#true} is VALID [2022-04-27 16:35:15,097 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} [57] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, 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] {24#true} is VALID [2022-04-27 16:35:15,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} [59] L16-2-->L16-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:35:15,098 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} [62] L16-3-->L23-2: Formula: (= v_main_~y~0_4 v_main_~z~0_5) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~z~0] {25#false} is VALID [2022-04-27 16:35:15,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} [64] L23-2-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:35:15,098 INFO L272 TraceCheckUtils]: 9: Hoare triple {25#false} [66] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 4294967296) (mod v_main_~n~0_3 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_8, 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_~x~0, main_~n~0] {25#false} is VALID [2022-04-27 16:35:15,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} [68] __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] {25#false} is VALID [2022-04-27 16:35:15,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} [70] 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[] {25#false} is VALID [2022-04-27 16:35:15,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25#false} is VALID [2022-04-27 16:35:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:15,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:15,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201103403] [2022-04-27 16:35:15,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201103403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:35:15,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:35:15,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:35:15,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202557105] [2022-04-27 16:35:15,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:35:15,105 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:35:15,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:15,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:15,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:35:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:15,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:35:15,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:35:15,147 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,188 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-27 16:35:15,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:35:15,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-27 16:35:15,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:15,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:35:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 25 transitions. [2022-04-27 16:35:15,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 25 transitions. [2022-04-27 16:35:15,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:15,228 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:35:15,228 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 16:35:15,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:35:15,232 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:15,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:35:15,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 16:35:15,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 16:35:15,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:15,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,250 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,250 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,251 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:35:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:35:15,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:15,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:15,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 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 14 states. [2022-04-27 16:35:15,252 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 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 14 states. [2022-04-27 16:35:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,254 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-04-27 16:35:15,254 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:35:15,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:15,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:15,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:15,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-27 16:35:15,256 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 13 [2022-04-27 16:35:15,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:15,256 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-27 16:35:15,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,257 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-27 16:35:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-27 16:35:15,257 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:15,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:15,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:35:15,257 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1920399339, now seen corresponding path program 1 times [2022-04-27 16:35:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:15,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966529407] [2022-04-27 16:35:15,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:15,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:15,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {95#true} is VALID [2022-04-27 16:35:15,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {95#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:15,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95#true} {95#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:15,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {95#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:15,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {95#true} is VALID [2022-04-27 16:35:15,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {95#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:15,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95#true} {95#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:15,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {95#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {95#true} is VALID [2022-04-27 16:35:15,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {95#true} [57] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, 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] {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 16:35:15,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} [60] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 16:35:15,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} [62] L16-3-->L23-2: Formula: (= v_main_~y~0_4 v_main_~z~0_5) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~z~0] {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 16:35:15,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} [64] L23-2-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-27 16:35:15,389 INFO L272 TraceCheckUtils]: 9: Hoare triple {100#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} [66] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 4294967296) (mod v_main_~n~0_3 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_8, 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_~x~0, main_~n~0] {101#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:35:15,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#(not (= |__VERIFIER_assert_#in~cond| 0))} [68] __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] {102#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:35:15,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {102#(not (= __VERIFIER_assert_~cond 0))} [70] 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[] {96#false} is VALID [2022-04-27 16:35:15,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {96#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#false} is VALID [2022-04-27 16:35:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:15,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:15,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966529407] [2022-04-27 16:35:15,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966529407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:35:15,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:35:15,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 16:35:15,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153340627] [2022-04-27 16:35:15,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:35:15,393 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-27 16:35:15,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:15,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:15,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 16:35:15,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:15,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 16:35:15,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 16:35:15,410 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,505 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 16:35:15,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 16:35:15,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-27 16:35:15,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-27 16:35:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2022-04-27 16:35:15,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 25 transitions. [2022-04-27 16:35:15,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:15,538 INFO L225 Difference]: With dead ends: 21 [2022-04-27 16:35:15,538 INFO L226 Difference]: Without dead ends: 18 [2022-04-27 16:35:15,538 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 16:35:15,539 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:15,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 29 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-04-27 16:35:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-27 16:35:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-27 16:35:15,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:15,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,542 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,542 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,543 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 16:35:15,543 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 16:35:15,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:15,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:15,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 16:35:15,544 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-27 16:35:15,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,545 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2022-04-27 16:35:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-27 16:35:15,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:15,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:15,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:15,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:15,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-27 16:35:15,546 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-27 16:35:15,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:15,546 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-27 16:35:15,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-27 16:35:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:35:15,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:15,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:15,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:35:15,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash -570442020, now seen corresponding path program 1 times [2022-04-27 16:35:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:15,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754368153] [2022-04-27 16:35:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:15,559 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:15,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:15,587 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:15,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:15,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {186#true} is VALID [2022-04-27 16:35:15,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 16:35:15,722 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186#true} {186#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 16:35:15,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {186#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:15,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {186#true} is VALID [2022-04-27 16:35:15,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 16:35:15,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {186#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 16:35:15,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {186#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {186#true} is VALID [2022-04-27 16:35:15,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} [57] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, 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] {191#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-27 16:35:15,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {191#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [60] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {191#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-27 16:35:15,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {191#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [62] L16-3-->L23-2: Formula: (= v_main_~y~0_4 v_main_~z~0_5) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~z~0] {192#(and (= main_~z~0 0) (= main_~n~0 main_~x~0))} is VALID [2022-04-27 16:35:15,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {192#(and (= main_~z~0 0) (= main_~n~0 main_~x~0))} [65] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_4 4294967296))) (or (and (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_3 v_main_~z~0_4) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_4 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_3 v_it_2 1) v_main_~z~0_4)) (not (<= 1 v_it_2)))) (< v_main_~z~0_3 v_main_~z~0_4) (= (+ (* (- 1) v_main_~z~0_3) v_main_~x~0_3 v_main_~z~0_4) v_main_~x~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {192#(and (= main_~z~0 0) (= main_~n~0 main_~x~0))} is VALID [2022-04-27 16:35:15,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {192#(and (= main_~z~0 0) (= main_~n~0 main_~x~0))} [64] L23-2-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {193#(= main_~n~0 main_~x~0)} is VALID [2022-04-27 16:35:15,727 INFO L272 TraceCheckUtils]: 10: Hoare triple {193#(= main_~n~0 main_~x~0)} [66] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 4294967296) (mod v_main_~n~0_3 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_8, 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_~x~0, main_~n~0] {194#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:35:15,728 INFO L290 TraceCheckUtils]: 11: Hoare triple {194#(not (= |__VERIFIER_assert_#in~cond| 0))} [68] __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] {195#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:35:15,728 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#(not (= __VERIFIER_assert_~cond 0))} [70] 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[] {187#false} is VALID [2022-04-27 16:35:15,728 INFO L290 TraceCheckUtils]: 13: Hoare triple {187#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {187#false} is VALID [2022-04-27 16:35:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 16:35:15,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:15,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754368153] [2022-04-27 16:35:15,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754368153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:35:15,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:35:15,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-27 16:35:15,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435842066] [2022-04-27 16:35:15,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:35:15,735 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-27 16:35:15,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:15,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:15,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:35:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:35:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:35:15,748 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,881 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-27 16:35:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 16:35:15,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-27 16:35:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:15,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-27 16:35:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2022-04-27 16:35:15,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2022-04-27 16:35:15,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:15,913 INFO L225 Difference]: With dead ends: 22 [2022-04-27 16:35:15,913 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 16:35:15,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-27 16:35:15,917 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:15,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-04-27 16:35:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 16:35:15,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 16:35:15,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:15,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,921 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,922 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,924 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:35:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 16:35:15,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:15,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:15,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:35:15,924 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 16:35:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:15,926 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-27 16:35:15,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-27 16:35:15,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:15,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:15,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:15,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:15,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-27 16:35:15,927 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-27 16:35:15,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:15,928 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-27 16:35:15,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:15,928 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-27 16:35:15,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 16:35:15,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:15,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:15,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 16:35:15,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:15,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:15,929 INFO L85 PathProgramCache]: Analyzing trace with hash -688526500, now seen corresponding path program 1 times [2022-04-27 16:35:15,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:15,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654331762] [2022-04-27 16:35:15,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:15,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:15,954 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:15,992 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:16,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:16,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {278#true} is VALID [2022-04-27 16:35:16,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:16,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {278#true} {278#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:16,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:16,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {278#true} is VALID [2022-04-27 16:35:16,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:16,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:16,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:16,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} [57] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, 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] {283#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:35:16,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [61] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~x~0_6 4294967296))) (or (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_6 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~x~0_5 v_it_1 1) v_main_~x~0_6)))) (< 0 .cse0) (< v_main_~x~0_5 v_main_~x~0_6) (= v_main_~y~0_2 (+ v_main_~x~0_6 v_main_~y~0_3 (* (- 1) v_main_~x~0_5)))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~y~0_3 v_main_~y~0_2) (= v_main_~x~0_5 v_main_~x~0_6) (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {284#(or (and (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-27 16:35:16,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(or (and (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (not (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))))) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [60] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {285#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (* 4294967296 (div main_~x~0 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-27 16:35:16,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {285#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (* 4294967296 (div main_~x~0 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} [62] L16-3-->L23-2: Formula: (= v_main_~y~0_4 v_main_~z~0_5) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~z~0] {286#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (* 4294967296 (div main_~x~0 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))))} is VALID [2022-04-27 16:35:16,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {286#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (* 4294967296 (div main_~x~0 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))))} [64] L23-2-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {287#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (* 4294967296 (div main_~x~0 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 16:35:16,286 INFO L272 TraceCheckUtils]: 10: Hoare triple {287#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (* 4294967296 (div main_~x~0 4294967296)) main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [66] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 4294967296) (mod v_main_~n~0_3 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_8, 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_~x~0, main_~n~0] {288#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:35:16,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {288#(not (= |__VERIFIER_assert_#in~cond| 0))} [68] __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] {289#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:35:16,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {289#(not (= __VERIFIER_assert_~cond 0))} [70] 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[] {279#false} is VALID [2022-04-27 16:35:16,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-27 16:35:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:16,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:16,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654331762] [2022-04-27 16:35:16,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654331762] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:16,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638194666] [2022-04-27 16:35:16,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:16,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:16,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:16,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:35:16,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 16:35:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:16,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 16:35:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:16,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:35:17,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:17,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} [55] 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] {278#true} is VALID [2022-04-27 16:35:17,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:17,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:17,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:17,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} [57] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, 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] {283#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:35:17,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {283#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [61] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~x~0_6 4294967296))) (or (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_6 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~x~0_5 v_it_1 1) v_main_~x~0_6)))) (< 0 .cse0) (< v_main_~x~0_5 v_main_~x~0_6) (= v_main_~y~0_2 (+ v_main_~x~0_6 v_main_~y~0_3 (* (- 1) v_main_~x~0_5)))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~y~0_3 v_main_~y~0_2) (= v_main_~x~0_5 v_main_~x~0_6) (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {312#(or (and (= main_~n~0 main_~x~0) (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} is VALID [2022-04-27 16:35:17,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#(or (and (= main_~n~0 main_~x~0) (<= (mod main_~n~0 4294967296) 0) (= main_~y~0 0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))))} [60] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {316#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} is VALID [2022-04-27 16:35:17,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {316#(and (not (< 0 (mod main_~x~0 4294967296))) (or (and (< main_~x~0 main_~n~0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (= main_~y~0 (+ main_~n~0 (* (- 1) main_~x~0)))) (and (= main_~n~0 main_~x~0) (= main_~y~0 0))))} [62] L16-3-->L23-2: Formula: (= v_main_~y~0_4 v_main_~z~0_5) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~z~0] {320#(and (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 1) main_~x~0))))) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:35:17,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {320#(and (or (and (= main_~z~0 0) (= main_~n~0 main_~x~0)) (and (< main_~x~0 main_~n~0) (forall ((v_it_1 Int)) (or (< 0 (mod (+ main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 main_~x~0 1) main_~n~0)) (not (<= 1 v_it_1)))) (< 0 (mod main_~n~0 4294967296)) (= main_~z~0 (+ main_~n~0 (* (- 1) main_~x~0))))) (not (< 0 (mod main_~x~0 4294967296))))} [64] L23-2-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {324#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~x~0 4294967296))))} is VALID [2022-04-27 16:35:17,738 INFO L272 TraceCheckUtils]: 10: Hoare triple {324#(and (= main_~n~0 main_~x~0) (not (< 0 (mod main_~x~0 4294967296))))} [66] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 4294967296) (mod v_main_~n~0_3 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_8, 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_~x~0, main_~n~0] {328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:17,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __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] {332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:17,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#(<= 1 __VERIFIER_assert_~cond)} [70] 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[] {279#false} is VALID [2022-04-27 16:35:17,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-27 16:35:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:17,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:35:22,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {279#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {279#false} is VALID [2022-04-27 16:35:22,470 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#(<= 1 __VERIFIER_assert_~cond)} [70] 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[] {279#false} is VALID [2022-04-27 16:35:22,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {328#(<= 1 |__VERIFIER_assert_#in~cond|)} [68] __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] {332#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 16:35:22,471 INFO L272 TraceCheckUtils]: 10: Hoare triple {348#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} [66] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 4294967296) (mod v_main_~n~0_3 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_8, 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_~x~0, main_~n~0] {328#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 16:35:22,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {352#(or (< 0 (mod main_~z~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)))} [64] L23-2-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {348#(= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296))} is VALID [2022-04-27 16:35:22,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(or (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} [62] L16-3-->L23-2: Formula: (= v_main_~y~0_4 v_main_~z~0_5) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~z~0] {352#(or (< 0 (mod main_~z~0 4294967296)) (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)))} is VALID [2022-04-27 16:35:22,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(or (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} [60] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {356#(or (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:35:22,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#(forall ((aux_mod_aux_mod_v_main_~x~0_16_31_42 Int) (aux_div_aux_mod_v_main_~x~0_16_31_42 Int)) (or (<= 4294967296 (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42)) (< (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42) 0) (and (or (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~y~0) 4294967296))) (forall ((aux_div_v_main_~x~0_16_31 Int)) (not (= main_~x~0 (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42)))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_16_31 Int) (aux_div_v_main_~y~0_9_30 Int)) (or (exists ((v_it_1 Int)) (and (<= (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) v_it_1 (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42 1) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= 1 v_it_1))) (< (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~y~0_9_30 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42) (+ main_~y~0 main_~x~0)) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42) main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~y~0_9_30 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42)))) (not (< 0 (mod main_~x~0 4294967296))))) (< 0 aux_mod_aux_mod_v_main_~x~0_16_31_42) (< aux_mod_aux_mod_v_main_~x~0_16_31_42 0) (= (mod main_~n~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42))))} [61] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~x~0_6 4294967296))) (or (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_6 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~x~0_5 v_it_1 1) v_main_~x~0_6)))) (< 0 .cse0) (< v_main_~x~0_5 v_main_~x~0_6) (= v_main_~y~0_2 (+ v_main_~x~0_6 v_main_~y~0_3 (* (- 1) v_main_~x~0_5)))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~y~0_3 v_main_~y~0_2) (= v_main_~x~0_5 v_main_~x~0_6) (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {360#(or (= (mod main_~n~0 4294967296) (mod main_~x~0 4294967296)) (< 0 (mod main_~x~0 4294967296)) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 16:35:22,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {278#true} [57] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, 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] {364#(forall ((aux_mod_aux_mod_v_main_~x~0_16_31_42 Int) (aux_div_aux_mod_v_main_~x~0_16_31_42 Int)) (or (<= 4294967296 (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42)) (< (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42) 0) (and (or (< (div (+ (- 1) (* (- 1) main_~y~0)) (- 4294967296)) (+ 2 (div (+ (- 1) main_~y~0) 4294967296))) (forall ((aux_div_v_main_~x~0_16_31 Int)) (not (= main_~x~0 (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42)))) (< 0 (mod main_~x~0 4294967296))) (or (forall ((aux_div_v_main_~x~0_16_31 Int) (aux_div_v_main_~y~0_9_30 Int)) (or (exists ((v_it_1 Int)) (and (<= (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) v_it_1 (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42 1) main_~x~0) (not (< 0 (mod (+ main_~x~0 (* v_it_1 4294967295)) 4294967296))) (<= 1 v_it_1))) (< (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~y~0_9_30 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42) (+ main_~y~0 main_~x~0)) (not (< (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42) main_~x~0)) (< (+ main_~y~0 main_~x~0) (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) (* aux_div_v_main_~y~0_9_30 4294967296) (* aux_div_v_main_~x~0_16_31 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42)))) (not (< 0 (mod main_~x~0 4294967296))))) (< 0 aux_mod_aux_mod_v_main_~x~0_16_31_42) (< aux_mod_aux_mod_v_main_~x~0_16_31_42 0) (= (mod main_~n~0 4294967296) (+ (* aux_div_aux_mod_v_main_~x~0_16_31_42 4294967296) aux_mod_aux_mod_v_main_~x~0_16_31_42))))} is VALID [2022-04-27 16:35:22,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {278#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:22,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {278#true} {278#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:22,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {278#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:22,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {278#true} [55] 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] {278#true} is VALID [2022-04-27 16:35:22,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {278#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {278#true} is VALID [2022-04-27 16:35:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:22,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638194666] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:35:22,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:35:22,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-04-27 16:35:22,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385263603] [2022-04-27 16:35:22,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:35:22,907 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 14 [2022-04-27 16:35:22,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:35:22,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:23,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:23,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 16:35:23,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:35:23,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 16:35:23,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-04-27 16:35:23,023 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:23,176 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-27 16:35:23,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-27 16:35:23,177 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 14 [2022-04-27 16:35:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:35:23,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:23,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2022-04-27 16:35:23,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:23,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 30 transitions. [2022-04-27 16:35:23,179 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 30 transitions. [2022-04-27 16:35:25,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 29 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 16:35:25,255 INFO L225 Difference]: With dead ends: 25 [2022-04-27 16:35:25,255 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 16:35:25,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-04-27 16:35:25,255 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:35:25,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 61 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-04-27 16:35:25,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 16:35:25,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-27 16:35:25,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:35:25,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:25,258 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:25,258 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:25,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:25,259 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 16:35:25,259 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 16:35:25,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:25,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:25,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 16:35:25,259 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 16:35:25,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:35:25,260 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-27 16:35:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-27 16:35:25,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:35:25,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:35:25,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:35:25,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:35:25,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:25,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-27 16:35:25,262 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 14 [2022-04-27 16:35:25,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:35:25,263 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-27 16:35:25,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:35:25,263 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-27 16:35:25,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:35:25,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:35:25,263 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:35:25,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 16:35:25,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:25,475 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:35:25,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:35:25,475 INFO L85 PathProgramCache]: Analyzing trace with hash 157235595, now seen corresponding path program 1 times [2022-04-27 16:35:25,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:35:25,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007813160] [2022-04-27 16:35:25,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:25,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:35:25,486 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:25,489 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:25,517 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:25,532 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.5))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-04-27 16:35:25,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:35:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:35:25,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {477#true} is VALID [2022-04-27 16:35:25,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {477#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-27 16:35:25,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-27 16:35:25,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {477#true} [53] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:35:25,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [55] 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] {477#true} is VALID [2022-04-27 16:35:25,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {477#true} [58] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-27 16:35:25,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {477#true} {477#true} [75] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-27 16:35:25,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {477#true} [54] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {477#true} is VALID [2022-04-27 16:35:25,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {477#true} [57] mainENTRY-->L16-2: Formula: (and (= v_main_~y~0_1 0) (= v_main_~n~0_1 v_main_~x~0_1) (= v_main_~n~0_1 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~y~0=v_main_~y~0_1, 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] {482#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-27 16:35:25,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {482#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [61] L16-2-->L16-2: Formula: (let ((.cse0 (mod v_main_~x~0_6 4294967296))) (or (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_6 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~x~0_5 v_it_1 1) v_main_~x~0_6)))) (< 0 .cse0) (< v_main_~x~0_5 v_main_~x~0_6) (= v_main_~y~0_2 (+ v_main_~x~0_6 v_main_~y~0_3 (* (- 1) v_main_~x~0_5)))) (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (= v_main_~y~0_3 v_main_~y~0_2) (= v_main_~x~0_5 v_main_~x~0_6) (<= .cse0 0)))) InVars {main_~y~0=v_main_~y~0_3, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_2, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_5, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {483#(or (and (<= 0 main_~y~0) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295))))} is VALID [2022-04-27 16:35:25,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#(or (and (<= 0 main_~y~0) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295))))} [60] L16-2-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {484#(or (and (<= 0 main_~y~0) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)))))} is VALID [2022-04-27 16:35:25,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {484#(or (and (<= 0 main_~y~0) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= main_~y~0 0)) (and (<= (+ main_~y~0 main_~x~0) main_~n~0) (<= main_~n~0 (+ main_~y~0 main_~x~0)) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296)))))} [62] L16-3-->L23-2: Formula: (= v_main_~y~0_4 v_main_~z~0_5) InVars {main_~y~0=v_main_~y~0_4} OutVars{main_~y~0=v_main_~y~0_4, main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[main_~z~0] {485#(or (and (<= main_~z~0 0) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0)) (and (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0)))} is VALID [2022-04-27 16:35:25,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {485#(or (and (<= main_~z~0 0) (<= main_~x~0 main_~n~0) (<= main_~n~0 main_~x~0) (<= 0 main_~z~0)) (and (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ main_~z~0 main_~x~0) main_~n~0)))} [65] L23-2-->L23-2: Formula: (let ((.cse0 (mod v_main_~z~0_4 4294967296))) (or (and (<= .cse0 0) (= v_main_~x~0_3 v_main_~x~0_2) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_3 v_main_~z~0_4) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (< 0 .cse0) (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_4 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_3 v_it_2 1) v_main_~z~0_4)) (not (<= 1 v_it_2)))) (< v_main_~z~0_3 v_main_~z~0_4) (= (+ (* (- 1) v_main_~z~0_3) v_main_~x~0_3 v_main_~z~0_4) v_main_~x~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_4, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {486#(and (or (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ (div main_~z~0 4294967296) (div main_~x~0 4294967296) 1) (div main_~n~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-27 16:35:25,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {486#(and (or (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (and (<= main_~n~0 (+ main_~z~0 main_~x~0)) (<= (+ (div main_~z~0 4294967296) (div main_~x~0 4294967296) 1) (div main_~n~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} [64] L23-2-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {487#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-27 16:35:25,848 INFO L272 TraceCheckUtils]: 11: Hoare triple {487#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [66] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod v_main_~x~0_8 4294967296) (mod v_main_~n~0_3 4294967296)) 1 0)) InVars {main_~x~0=v_main_~x~0_8, 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_~x~0, main_~n~0] {488#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 16:35:25,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {488#(not (= |__VERIFIER_assert_#in~cond| 0))} [68] __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] {489#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 16:35:25,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {489#(not (= __VERIFIER_assert_~cond 0))} [70] 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[] {478#false} is VALID [2022-04-27 16:35:25,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {478#false} [72] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {478#false} is VALID [2022-04-27 16:35:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:35:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:35:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007813160] [2022-04-27 16:35:25,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007813160] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:35:25,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642055493] [2022-04-27 16:35:25,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:35:25,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:35:25,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:35:25,850 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 16:35:25,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process