/usr/bin/java -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-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 21:16:54,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:16:54,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:16:54,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:16:54,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:16:54,639 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:16:54,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:16:54,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:16:54,644 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:16:54,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:16:54,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:16:54,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:16:54,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:16:54,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:16:54,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:16:54,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:16:54,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:16:54,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:16:54,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:16:54,672 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:16:54,673 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:16:54,674 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:16:54,675 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:16:54,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:16:54,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:16:54,681 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:16:54,681 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:16:54,682 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:16:54,682 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:16:54,682 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:16:54,682 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:16:54,683 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:16:54,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:16:54,684 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:16:54,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:16:54,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:16:54,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:16:54,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:16:54,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:16:54,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:16:54,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:16:54,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-02-14 21:16:54,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:16:54,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:16:54,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:16:54,702 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:16:54,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:16:54,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:16:54,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:16:54,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:16:54,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:16:54,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:16:54,703 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:16:54,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:16:54,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:16:54,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:16:54,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:16:54,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:16:54,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:16:54,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:16:54,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:16:54,704 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:16:54,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:16:54,704 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:16:54,705 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-02-14 21:16:54,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:16:54,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:16:54,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:16:54,914 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:16:54,914 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:16:54,915 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-02-14 21:16:54,969 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b9d6d13/2c0e1597a86a4f48b951ef52425057e4/FLAG62fa27f2b [2022-02-14 21:16:55,311 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:16:55,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-02-14 21:16:55,325 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b9d6d13/2c0e1597a86a4f48b951ef52425057e4/FLAG62fa27f2b [2022-02-14 21:16:55,740 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0b9d6d13/2c0e1597a86a4f48b951ef52425057e4 [2022-02-14 21:16:55,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:16:55,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:16:55,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:16:55,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:16:55,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:16:55,749 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,750 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fc294d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55, skipping insertion in model container [2022-02-14 21:16:55,750 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:16:55,764 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:16:55,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-02-14 21:16:55,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:16:55,910 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:16:55,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-02-14 21:16:55,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:16:55,943 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:16:55,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55 WrapperNode [2022-02-14 21:16:55,944 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:16:55,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:16:55,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:16:55,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:16:55,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:16:55,971 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:16:55,971 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:16:55,971 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:16:55,972 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (1/1) ... [2022-02-14 21:16:55,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:16:55,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:55,994 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-02-14 21:16:55,997 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-02-14 21:16:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:16:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:16:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:16:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:16:56,024 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:16:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:16:56,024 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:16:56,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:16:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:16:56,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:16:56,073 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:16:56,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:16:56,210 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:16:56,214 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:16:56,214 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-14 21:16:56,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:16:56 BoogieIcfgContainer [2022-02-14 21:16:56,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:16:56,216 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:16:56,216 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:16:56,231 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:16:56,233 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:16:56" (1/1) ... [2022-02-14 21:16:56,406 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-02-14 21:16:56,407 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_8, 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_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~y~0_9 v_main_~y~0_8) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0)) (and (= v_main_~x~0_3 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_4 v_main_~y~0_9)) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_9 v_it_1 1) v_main_~y~0_8)))) (< 0 .cse0) (< v_main_~y~0_9 v_main_~y~0_8)))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-02-14 21:16:56,518 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-02-14 21:16:56,519 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, 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_11 4294967296))) (or (and (< v_main_~z~0_10 v_main_~z~0_11) (= v_main_~x~0_8 (+ v_main_~z~0_11 v_main_~x~0_9 (* (- 1) v_main_~z~0_10))) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_10 v_it_2 1) v_main_~z~0_11)) (< 0 (mod (+ v_main_~z~0_11 (* v_it_2 4294967295)) 4294967296))))) (and (= v_main_~x~0_9 v_main_~x~0_8) (= v_main_~z~0_11 v_main_~z~0_10) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (<= .cse0 0) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-02-14 21:16:56,592 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-02-14 21:16:56,593 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_4, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|) (<= .cse0 0)) (and (= v_main_~y~0_4 (+ v_main_~y~0_5 v_main_~z~0_3 (* (- 1) v_main_~z~0_2))) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= (+ v_main_~z~0_3 v_it_3 1) v_main_~z~0_2)) (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_5 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-02-14 21:16:56,691 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-02-14 21:16:56,691 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_10, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (= v_main_~y~0_10 (+ (* (- 1) v_main_~x~0_6) v_main_~y~0_11 v_main_~x~0_7)) (< v_main_~x~0_6 v_main_~x~0_7)) (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~x~0_7 v_main_~x~0_6)))) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-02-14 21:16:56,766 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-02-14 21:16:56,767 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_13 4294967296))) (or (and (= v_main_~z~0_12 (+ v_main_~x~0_11 v_main_~z~0_13 (* (- 1) v_main_~x~0_10))) (< v_main_~x~0_11 v_main_~x~0_10) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~z~0_13 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_11 v_it_5 1) v_main_~x~0_10)))) (< 0 .cse0)) (and (= v_main_~x~0_11 v_main_~x~0_10) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (<= .cse0 0) (= v_main_~z~0_13 v_main_~z~0_12) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-02-14 21:16:56,840 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-02-14 21:16:56,840 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~z~0=v_main_~z~0_5, main_~y~0=v_main_~y~0_7} OutVars{main_~z~0=v_main_~z~0_4, main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_7 4294967296))) (or (and (= |v_main_#t~post15_3| |v_main_#t~post15_1|) (= |v_main_#t~post16_3| |v_main_#t~post16_1|) (= v_main_~y~0_7 v_main_~y~0_6) (= v_main_~z~0_5 v_main_~z~0_4) (<= .cse0 0)) (and (< 0 .cse0) (< v_main_~z~0_5 v_main_~z~0_4) (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_main_~z~0_5 v_it_6 1) v_main_~z~0_4)) (< 0 (mod (+ v_main_~y~0_7 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~y~0_6 (+ (* (- 1) v_main_~z~0_4) v_main_~y~0_7 v_main_~z~0_5))))) InVars {main_#t~post15=|v_main_#t~post15_3|, main_~y~0=v_main_~y~0_7, main_#t~post16=|v_main_#t~post16_3|, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] [2022-02-14 21:16:56,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:16:56 BasicIcfg [2022-02-14 21:16:56,845 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:16:56,846 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:16:56,846 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:16:56,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:16:56,849 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:16:55" (1/4) ... [2022-02-14 21:16:56,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365bc05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:16:56, skipping insertion in model container [2022-02-14 21:16:56,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:55" (2/4) ... [2022-02-14 21:16:56,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365bc05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:16:56, skipping insertion in model container [2022-02-14 21:16:56,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:16:56" (3/4) ... [2022-02-14 21:16:56,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365bc05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:16:56, skipping insertion in model container [2022-02-14 21:16:56,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:16:56" (4/4) ... [2022-02-14 21:16:56,853 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.cJordan [2022-02-14 21:16:56,857 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:16:56,857 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:16:56,884 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:16:56,888 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-14 21:16:56,889 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:16:56,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-14 21:16:56,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:16:56,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:56,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:56,903 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:56,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:56,907 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-02-14 21:16:56,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:56,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823372994] [2022-02-14 21:16:56,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:56,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:56,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:57,030 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:57,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823372994] [2022-02-14 21:16:57,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823372994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:16:57,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:16:57,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:16:57,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504006735] [2022-02-14 21:16:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:16:57,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:16:57,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:57,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:16:57,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:16:57,055 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:57,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:57,075 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-14 21:16:57,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:16:57,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 21:16:57,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:57,082 INFO L225 Difference]: With dead ends: 25 [2022-02-14 21:16:57,082 INFO L226 Difference]: Without dead ends: 18 [2022-02-14 21:16:57,083 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:16:57,086 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:16:57,087 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-14 21:16:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-14 21:16:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-14 21:16:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:57,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-02-14 21:16:57,111 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-02-14 21:16:57,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:57,111 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-14 21:16:57,111 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-14 21:16:57,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:16:57,112 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:57,112 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:57,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:16:57,113 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:57,116 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-02-14 21:16:57,116 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:57,116 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043434209] [2022-02-14 21:16:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:57,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:57,442 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:57,442 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043434209] [2022-02-14 21:16:57,442 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043434209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:16:57,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:16:57,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-14 21:16:57,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859650415] [2022-02-14 21:16:57,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:16:57,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-14 21:16:57,447 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:57,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-14 21:16:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-14 21:16:57,449 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:57,596 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2022-02-14 21:16:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 21:16:57,597 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-14 21:16:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:57,598 INFO L225 Difference]: With dead ends: 33 [2022-02-14 21:16:57,598 INFO L226 Difference]: Without dead ends: 30 [2022-02-14 21:16:57,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-02-14 21:16:57,602 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:16:57,602 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-14 21:16:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-14 21:16:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-02-14 21:16:57,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-02-14 21:16:57,615 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 17 [2022-02-14 21:16:57,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:57,616 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-02-14 21:16:57,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:57,616 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-02-14 21:16:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:16:57,617 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:57,617 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:57,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:16:57,617 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:57,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:57,618 INFO L85 PathProgramCache]: Analyzing trace with hash 34479891, now seen corresponding path program 1 times [2022-02-14 21:16:57,618 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:57,618 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963039969] [2022-02-14 21:16:57,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:57,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:57,633 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:16:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,672 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:16:57,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:57,833 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:57,833 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963039969] [2022-02-14 21:16:57,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963039969] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:57,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077519108] [2022-02-14 21:16:57,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:57,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:57,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:57,835 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-02-14 21:16:57,838 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-02-14 21:16:57,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:16:57,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:16:58,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:16:58,038 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077519108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:16:58,039 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:16:58,039 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-02-14 21:16:58,039 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644396892] [2022-02-14 21:16:58,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:16:58,039 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:16:58,040 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:58,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:16:58,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:16:58,041 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:58,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:58,090 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-02-14 21:16:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:16:58,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 21:16:58,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:58,092 INFO L225 Difference]: With dead ends: 32 [2022-02-14 21:16:58,092 INFO L226 Difference]: Without dead ends: 29 [2022-02-14 21:16:58,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:16:58,093 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:16:58,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 76 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-14 21:16:58,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-14 21:16:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-02-14 21:16:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-02-14 21:16:58,097 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-02-14 21:16:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:58,097 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-02-14 21:16:58,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:58,097 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-02-14 21:16:58,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:16:58,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:58,098 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:16:58,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-14 21:16:58,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:58,307 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-02-14 21:16:58,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:58,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030452198] [2022-02-14 21:16:58,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:58,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:58,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:16:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:16:58,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:58,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:58,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030452198] [2022-02-14 21:16:58,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030452198] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:58,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126348106] [2022-02-14 21:16:58,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:58,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:58,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:58,449 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-02-14 21:16:58,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-14 21:16:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:16:58,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:16:58,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:05,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:05,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126348106] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:05,296 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:05,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-02-14 21:17:05,296 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118906342] [2022-02-14 21:17:05,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:05,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-14 21:17:05,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:05,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-14 21:17:05,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-02-14 21:17:05,298 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 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-02-14 21:17:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:05,851 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2022-02-14 21:17:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 21:17:05,851 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 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 18 [2022-02-14 21:17:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:05,852 INFO L225 Difference]: With dead ends: 38 [2022-02-14 21:17:05,852 INFO L226 Difference]: Without dead ends: 35 [2022-02-14 21:17:05,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-02-14 21:17:05,853 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:05,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 72 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 22 Unchecked, 0.2s Time] [2022-02-14 21:17:05,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-14 21:17:05,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-02-14 21:17:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:05,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-02-14 21:17:05,856 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 18 [2022-02-14 21:17:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:05,856 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-02-14 21:17:05,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 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-02-14 21:17:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-02-14 21:17:05,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:17:05,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:05,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:05,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-14 21:17:06,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-14 21:17:06,058 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:06,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:06,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-02-14 21:17:06,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:06,059 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257810986] [2022-02-14 21:17:06,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:06,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:06,064 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:06,079 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:06,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:06,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:06,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:06,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257810986] [2022-02-14 21:17:06,417 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257810986] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:06,417 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46826104] [2022-02-14 21:17:06,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:06,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:06,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:06,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:06,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-14 21:17:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:06,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:17:06,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:06,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:17:06,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:17:06,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46826104] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:17:06,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:17:06,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-02-14 21:17:06,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597727752] [2022-02-14 21:17:06,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:17:06,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:17:06,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:06,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:17:06,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:17:06,757 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:06,905 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-02-14 21:17:06,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:17:06,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 21:17:06,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:06,907 INFO L225 Difference]: With dead ends: 34 [2022-02-14 21:17:06,907 INFO L226 Difference]: Without dead ends: 31 [2022-02-14 21:17:06,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:17:06,907 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:06,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-14 21:17:06,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-14 21:17:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-14 21:17:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:06,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-02-14 21:17:06,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 18 [2022-02-14 21:17:06,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:06,910 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2022-02-14 21:17:06,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:06,911 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2022-02-14 21:17:06,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:17:06,911 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:06,911 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:06,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-14 21:17:07,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:07,115 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:07,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:07,115 INFO L85 PathProgramCache]: Analyzing trace with hash 223241102, now seen corresponding path program 1 times [2022-02-14 21:17:07,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:07,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010125708] [2022-02-14 21:17:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:07,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:07,128 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:17:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:07,142 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:17:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:07,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:07,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:07,435 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:07,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010125708] [2022-02-14 21:17:07,435 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010125708] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:07,435 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953142995] [2022-02-14 21:17:07,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:07,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:07,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:07,436 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:07,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-14 21:17:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:07,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:17:07,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:17:07,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:17:07,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953142995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:17:07,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:17:07,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-02-14 21:17:07,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547222943] [2022-02-14 21:17:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:17:07,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:17:07,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:17:07,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:17:07,988 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:08,090 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-02-14 21:17:08,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:17:08,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 21:17:08,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:08,091 INFO L225 Difference]: With dead ends: 36 [2022-02-14 21:17:08,091 INFO L226 Difference]: Without dead ends: 33 [2022-02-14 21:17:08,092 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-02-14 21:17:08,092 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:08,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-14 21:17:08,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-14 21:17:08,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-02-14 21:17:08,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2022-02-14 21:17:08,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 18 [2022-02-14 21:17:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:08,095 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2022-02-14 21:17:08,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:08,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2022-02-14 21:17:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:17:08,096 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:08,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:08,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-14 21:17:08,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:08,307 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:08,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1522150354, now seen corresponding path program 1 times [2022-02-14 21:17:08,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:08,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808413659] [2022-02-14 21:17:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:08,313 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-02-14 21:17:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:08,324 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-02-14 21:17:08,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:08,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:08,622 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:08,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808413659] [2022-02-14 21:17:08,622 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808413659] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:08,622 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485455711] [2022-02-14 21:17:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:08,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:08,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:08,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:08,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-14 21:17:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:08,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:17:08,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:17:09,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:17:09,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485455711] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:17:09,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:17:09,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-02-14 21:17:09,022 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091884474] [2022-02-14 21:17:09,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:17:09,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:17:09,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:17:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:17:09,023 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:09,185 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2022-02-14 21:17:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:17:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 21:17:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:09,186 INFO L225 Difference]: With dead ends: 39 [2022-02-14 21:17:09,186 INFO L226 Difference]: Without dead ends: 36 [2022-02-14 21:17:09,186 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:17:09,187 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:09,187 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-14 21:17:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-14 21:17:09,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-02-14 21:17:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-02-14 21:17:09,190 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 18 [2022-02-14 21:17:09,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:09,190 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-02-14 21:17:09,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:09,190 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2022-02-14 21:17:09,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:17:09,190 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:09,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:09,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-14 21:17:09,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:09,391 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:09,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1504591698, now seen corresponding path program 1 times [2022-02-14 21:17:09,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:09,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878459536] [2022-02-14 21:17:09,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:09,396 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-02-14 21:17:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:09,419 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:09,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:09,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:09,811 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:09,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878459536] [2022-02-14 21:17:09,811 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878459536] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:09,811 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436965214] [2022-02-14 21:17:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:09,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:09,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:09,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:09,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-14 21:17:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:09,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-14 21:17:09,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:10,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:11,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:11,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436965214] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:11,456 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:11,457 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-02-14 21:17:11,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050160536] [2022-02-14 21:17:11,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:11,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-14 21:17:11,457 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-14 21:17:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:17:11,458 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:12,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:12,774 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2022-02-14 21:17:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-14 21:17:12,775 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 21:17:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:12,775 INFO L225 Difference]: With dead ends: 49 [2022-02-14 21:17:12,776 INFO L226 Difference]: Without dead ends: 46 [2022-02-14 21:17:12,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-02-14 21:17:12,776 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:12,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 73 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2022-02-14 21:17:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-14 21:17:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-02-14 21:17:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 31 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2022-02-14 21:17:12,780 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 55 transitions. Word has length 18 [2022-02-14 21:17:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:12,781 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 55 transitions. [2022-02-14 21:17:12,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2022-02-14 21:17:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:17:12,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:12,781 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:12,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-14 21:17:12,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:12,985 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1095597292, now seen corresponding path program 1 times [2022-02-14 21:17:12,987 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:12,987 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593514483] [2022-02-14 21:17:12,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:12,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:12,993 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:12,994 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:13,011 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:13,015 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:13,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:13,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:13,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:13,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593514483] [2022-02-14 21:17:13,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593514483] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:13,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377342379] [2022-02-14 21:17:13,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:13,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:13,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:13,460 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:13,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-14 21:17:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:13,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:17:13,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:17:13,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:16,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_22_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_22_31 Int)) (not (= (+ (* 4294967296 aux_div_v_main_~z~0_22_31) aux_mod_v_main_~z~0_22_31) c_main_~z~0)))) (or (not .cse0) (forall ((aux_div_v_main_~z~0_22_31 Int)) (or (not (< c_main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_22_31) aux_mod_v_main_~z~0_22_31))) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_22_31) aux_mod_v_main_~z~0_22_31)) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))))) (>= aux_mod_v_main_~z~0_22_31 4294967296) (> 0 aux_mod_v_main_~z~0_22_31) (= aux_mod_v_main_~z~0_22_31 (mod c_main_~n~0 4294967296)))) is different from false [2022-02-14 21:17:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-14 21:17:21,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377342379] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:21,094 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:21,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-02-14 21:17:21,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790824156] [2022-02-14 21:17:21,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:21,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-14 21:17:21,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:21,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-14 21:17:21,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=357, Unknown=2, NotChecked=40, Total=506 [2022-02-14 21:17:21,097 INFO L87 Difference]: Start difference. First operand 36 states and 55 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 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-02-14 21:17:28,830 WARN L228 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 53 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:17:29,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:29,175 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2022-02-14 21:17:29,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-14 21:17:29,176 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 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 19 [2022-02-14 21:17:29,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:29,176 INFO L225 Difference]: With dead ends: 55 [2022-02-14 21:17:29,176 INFO L226 Difference]: Without dead ends: 51 [2022-02-14 21:17:29,177 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=241, Invalid=817, Unknown=2, NotChecked=62, Total=1122 [2022-02-14 21:17:29,177 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:29,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 87 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 129 Invalid, 0 Unknown, 48 Unchecked, 0.3s Time] [2022-02-14 21:17:29,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-14 21:17:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-02-14 21:17:29,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 33 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:29,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2022-02-14 21:17:29,180 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 19 [2022-02-14 21:17:29,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:29,180 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2022-02-14 21:17:29,181 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 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-02-14 21:17:29,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2022-02-14 21:17:29,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:17:29,181 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:29,181 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:29,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-02-14 21:17:29,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:29,385 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:29,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:29,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-02-14 21:17:29,386 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:29,386 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300810239] [2022-02-14 21:17:29,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:29,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:29,390 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:29,391 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:29,413 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:29,415 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:29,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:29,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300810239] [2022-02-14 21:17:29,747 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300810239] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:29,747 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831036078] [2022-02-14 21:17:29,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:29,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:29,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:29,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:29,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-14 21:17:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:29,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:17:29,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:30,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:17:30,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:17:30,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831036078] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:17:30,072 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:17:30,073 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-02-14 21:17:30,073 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612133690] [2022-02-14 21:17:30,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:17:30,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:17:30,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:17:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-02-14 21:17:30,074 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:30,210 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2022-02-14 21:17:30,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:17:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:17:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:30,211 INFO L225 Difference]: With dead ends: 45 [2022-02-14 21:17:30,211 INFO L226 Difference]: Without dead ends: 42 [2022-02-14 21:17:30,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-02-14 21:17:30,212 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:30,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 76 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-14 21:17:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-14 21:17:30,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-02-14 21:17:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2022-02-14 21:17:30,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 19 [2022-02-14 21:17:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:30,215 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2022-02-14 21:17:30,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:30,215 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2022-02-14 21:17:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:17:30,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:30,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:30,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-14 21:17:30,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-14 21:17:30,417 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:30,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:30,417 INFO L85 PathProgramCache]: Analyzing trace with hash 61379980, now seen corresponding path program 1 times [2022-02-14 21:17:30,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:30,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577834918] [2022-02-14 21:17:30,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:30,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:30,421 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:30,422 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:17:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:30,432 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:30,435 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:17:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:30,789 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:30,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577834918] [2022-02-14 21:17:30,789 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577834918] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:30,789 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132083520] [2022-02-14 21:17:30,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:30,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:30,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:30,790 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:30,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-14 21:17:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:30,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:17:30,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:31,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:17:31,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:17:31,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132083520] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:17:31,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:17:31,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-02-14 21:17:31,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067365722] [2022-02-14 21:17:31,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:17:31,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:17:31,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:17:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-02-14 21:17:31,190 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:31,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:31,309 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2022-02-14 21:17:31,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-14 21:17:31,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:17:31,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:31,309 INFO L225 Difference]: With dead ends: 46 [2022-02-14 21:17:31,309 INFO L226 Difference]: Without dead ends: 43 [2022-02-14 21:17:31,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:17:31,310 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:31,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 66 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-14 21:17:31,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-14 21:17:31,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-02-14 21:17:31,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2022-02-14 21:17:31,312 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 19 [2022-02-14 21:17:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:31,313 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-02-14 21:17:31,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2022-02-14 21:17:31,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:17:31,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:31,313 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:31,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-02-14 21:17:31,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:31,519 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:31,520 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-02-14 21:17:31,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:31,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854097035] [2022-02-14 21:17:31,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:31,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:31,524 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:31,525 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:31,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:31,545 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:31,546 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:17:31,869 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:31,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854097035] [2022-02-14 21:17:31,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854097035] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:31,869 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945906482] [2022-02-14 21:17:31,869 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:17:31,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:31,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:31,870 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:31,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-14 21:17:31,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:17:31,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:17:31,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 21:17:31,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:32,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:17:32,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:34,603 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_28_31 Int)) (or (> 0 aux_mod_v_main_~z~0_28_31) (>= aux_mod_v_main_~z~0_28_31 4294967296) (= aux_mod_v_main_~z~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_28_31 Int)) (not (= (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31)) c_main_~z~0)))) (or (not .cse0) (forall ((aux_div_v_main_~z~0_28_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31))))))))))) is different from false [2022-02-14 21:17:39,522 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_28_31 Int)) (or (> 0 aux_mod_v_main_~z~0_28_31) (>= aux_mod_v_main_~z~0_28_31 4294967296) (= aux_mod_v_main_~z~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_28_31 Int)) (not (= (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31)) c_main_~z~0)))) (or (and (or (forall ((aux_div_v_main_~z~0_28_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31)))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_28_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~z~0_28_31 Int) (aux_div_v_main_~y~0_28_31 Int) (aux_mod_v_main_~y~0_28_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_28_31 4294967296))) (or (<= aux_mod_v_main_~y~0_28_31 0) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_6 (* aux_div_v_main_~y~0_28_31 4294967296) aux_mod_v_main_~y~0_28_31 1) c_main_~y~0))) (<= (+ aux_mod_v_main_~z~0_28_31 .cse1 (* 4294967296 aux_div_v_main_~z~0_28_31) aux_mod_v_main_~y~0_28_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~y~0_28_31) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_28_31 (* aux_div_v_main_~y~0_28_31 4294967296) (* 4294967296 aux_div_v_main_~z~0_28_31) aux_mod_v_main_~y~0_28_31)) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_28_31 (* v_it_6 4294967295)) 4294967296))))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_28_31)))))) (not .cse0)))))) is different from false [2022-02-14 21:17:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-14 21:17:43,696 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945906482] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:43,696 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:43,696 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 19 [2022-02-14 21:17:43,697 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501594074] [2022-02-14 21:17:43,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:43,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-14 21:17:43,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:43,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-14 21:17:43,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=213, Unknown=2, NotChecked=62, Total=342 [2022-02-14 21:17:43,698 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:44,144 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-02-14 21:17:44,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-14 21:17:44,145 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:17:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:44,146 INFO L225 Difference]: With dead ends: 50 [2022-02-14 21:17:44,146 INFO L226 Difference]: Without dead ends: 44 [2022-02-14 21:17:44,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=118, Invalid=394, Unknown=2, NotChecked=86, Total=600 [2022-02-14 21:17:44,147 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:44,147 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 57 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-02-14 21:17:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-14 21:17:44,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-02-14 21:17:44,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:44,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2022-02-14 21:17:44,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 19 [2022-02-14 21:17:44,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:44,150 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-02-14 21:17:44,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2022-02-14 21:17:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:17:44,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:44,150 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:17:44,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-14 21:17:44,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-14 21:17:44,355 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:44,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:44,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-02-14 21:17:44,356 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:44,356 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929610112] [2022-02-14 21:17:44,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:44,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:44,359 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:44,360 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:44,387 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:44,390 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:17:44,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:44,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:44,773 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:44,773 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929610112] [2022-02-14 21:17:44,773 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929610112] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:44,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691428363] [2022-02-14 21:17:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:44,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:44,775 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:17:44,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-14 21:17:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:44,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:17:44,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:17:45,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:47,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_33_31 Int)) (or (> 0 aux_mod_v_main_~z~0_33_31) (>= aux_mod_v_main_~z~0_33_31 4294967296) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_33_31 Int)) (not (= (+ aux_mod_v_main_~z~0_33_31 (* 4294967296 aux_div_v_main_~z~0_33_31)) c_main_~z~0)))) (or (forall ((aux_div_v_main_~z~0_33_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_33_31 (* 4294967296 aux_div_v_main_~z~0_33_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_33_31 (* 4294967296 aux_div_v_main_~z~0_33_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (not .cse0)))) (= aux_mod_v_main_~z~0_33_31 (mod c_main_~n~0 4294967296)))) is different from false [2022-02-14 21:17:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-14 21:17:59,174 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691428363] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:59,174 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:59,175 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-02-14 21:17:59,175 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492963819] [2022-02-14 21:17:59,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:59,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-14 21:17:59,175 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:59,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-14 21:17:59,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=4, NotChecked=38, Total=462 [2022-02-14 21:17:59,176 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 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-02-14 21:18:04,899 WARN L228 SmtUtils]: Spent 5.37s on a formula simplification. DAG size of input: 60 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:18:11,545 WARN L228 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 53 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:18:11,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:18:11,977 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2022-02-14 21:18:11,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-14 21:18:11,978 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 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 19 [2022-02-14 21:18:11,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:18:11,978 INFO L225 Difference]: With dead ends: 52 [2022-02-14 21:18:11,978 INFO L226 Difference]: Without dead ends: 48 [2022-02-14 21:18:11,979 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=4, NotChecked=60, Total=1056 [2022-02-14 21:18:11,979 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:18:11,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 76 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 119 Invalid, 0 Unknown, 48 Unchecked, 0.2s Time] [2022-02-14 21:18:11,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-14 21:18:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-02-14 21:18:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:18:11,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-02-14 21:18:11,982 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 19 [2022-02-14 21:18:11,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:18:11,982 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-02-14 21:18:11,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 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-02-14 21:18:11,982 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-02-14 21:18:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:18:11,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:18:11,982 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:18:12,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-02-14 21:18:12,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-14 21:18:12,191 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:18:12,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:18:12,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-02-14 21:18:12,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:18:12,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458224506] [2022-02-14 21:18:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:12,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:18:12,196 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:18:12,197 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:18:12,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:12,209 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:18:12,211 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:18:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:18:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:18:12,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:18:12,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458224506] [2022-02-14 21:18:12,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458224506] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:18:12,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577012780] [2022-02-14 21:18:12,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:12,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:18:12,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:18:12,495 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:18:12,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-14 21:18:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:12,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 21:18:12,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:18:12,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:18:12,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:18:31,192 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_38_31 Int)) (or (and (or (forall ((aux_mod_v_main_~y~0_36_31 Int)) (or (< 0 aux_mod_v_main_~y~0_36_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31) c_main_~y~0)))) (or (not .cse0) (forall ((aux_div_v_main_~y~0_36_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)))))))) (< aux_mod_v_main_~y~0_36_31 0))) (forall ((aux_div_v_main_~z~0_38_31 Int)) (not (= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~z~0)))) (forall ((aux_mod_v_main_~y~0_36_31 Int) (aux_div_v_main_~z~0_38_31 Int)) (or (<= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~z~0) (<= 4294967296 aux_mod_v_main_~y~0_36_31) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_36_31 (* v_it_6 4294967295)) 4294967296))))) (<= aux_mod_v_main_~y~0_36_31 0) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~y~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31) c_main_~y~0)))) (or (not .cse1) (forall ((aux_div_v_main_~y~0_36_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31))))))))))) (> 0 aux_mod_v_main_~z~0_38_31) (= aux_mod_v_main_~z~0_38_31 (mod c_main_~n~0 4294967296)) (>= aux_mod_v_main_~z~0_38_31 4294967296))) is different from false [2022-02-14 21:18:59,919 WARN L228 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:19:27,282 WARN L228 SmtUtils]: Spent 6.17s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:19:30,562 WARN L860 $PredicateComparison]: unable to prove that (or (< 0 (mod c_main_~y~0 4294967296)) (forall ((aux_mod_v_main_~z~0_38_31 Int)) (or (> 0 aux_mod_v_main_~z~0_38_31) (= aux_mod_v_main_~z~0_38_31 (mod c_main_~n~0 4294967296)) (and (or (forall ((aux_mod_v_main_~y~0_36_31 Int)) (or (< 0 aux_mod_v_main_~y~0_36_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31) c_main_~y~0)))) (or (not .cse0) (forall ((aux_div_v_main_~y~0_36_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)))))))) (< aux_mod_v_main_~y~0_36_31 0))) (forall ((aux_div_v_main_~z~0_38_31 Int)) (not (= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~y~0)))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_mod_v_main_~y~0_36_31 Int) (aux_div_v_main_~y~0_36_31 Int) (aux_div_v_main_~z~0_38_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_36_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 c_main_~y~0 1) (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31))))) (<= 4294967296 aux_mod_v_main_~y~0_36_31) (<= aux_mod_v_main_~y~0_36_31 0) (<= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~y~0))))) (>= aux_mod_v_main_~z~0_38_31 4294967296)))) is different from true [2022-02-14 21:19:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-14 21:19:35,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577012780] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:35,505 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:35,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 19 [2022-02-14 21:19:35,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568656690] [2022-02-14 21:19:35,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:35,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-14 21:19:35,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:35,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-14 21:19:35,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=203, Unknown=22, NotChecked=62, Total=342 [2022-02-14 21:19:35,506 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:51,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:51,667 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2022-02-14 21:19:51,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-14 21:19:51,667 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:19:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:51,668 INFO L225 Difference]: With dead ends: 50 [2022-02-14 21:19:51,668 INFO L226 Difference]: Without dead ends: 47 [2022-02-14 21:19:51,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 87.1s TimeCoverageRelationStatistics Valid=112, Invalid=420, Unknown=28, NotChecked=90, Total=650 [2022-02-14 21:19:51,668 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:51,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 62 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 81 Invalid, 0 Unknown, 121 Unchecked, 0.2s Time] [2022-02-14 21:19:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-02-14 21:19:51,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-02-14 21:19:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:51,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-02-14 21:19:51,671 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-02-14 21:19:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:51,671 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-02-14 21:19:51,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-02-14 21:19:51,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:19:51,672 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:51,672 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:19:51,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-02-14 21:19:51,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-02-14 21:19:51,875 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:51,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-02-14 21:19:51,876 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:51,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267769765] [2022-02-14 21:19:51,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:51,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:19:51,880 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:51,887 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:19:51,889 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:52,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:52,214 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:52,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267769765] [2022-02-14 21:19:52,214 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267769765] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:52,214 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817710390] [2022-02-14 21:19:52,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:52,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:52,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:52,215 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:19:52,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-14 21:19:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:52,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:19:52,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:52,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:19:52,616 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:19:52,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817710390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:19:52,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:19:52,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-02-14 21:19:52,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228761880] [2022-02-14 21:19:52,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:19:52,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:19:52,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:19:52,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-02-14 21:19:52,617 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:52,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:52,752 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-02-14 21:19:52,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:19:52,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:19:52,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:52,753 INFO L225 Difference]: With dead ends: 51 [2022-02-14 21:19:52,753 INFO L226 Difference]: Without dead ends: 48 [2022-02-14 21:19:52,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-02-14 21:19:52,754 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:52,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 106 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-02-14 21:19:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-14 21:19:52,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-02-14 21:19:52,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:52,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-02-14 21:19:52,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-02-14 21:19:52,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:52,759 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-02-14 21:19:52,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-02-14 21:19:52,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:19:52,759 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:52,759 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:19:52,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-02-14 21:19:52,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-02-14 21:19:52,975 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1138278570, now seen corresponding path program 1 times [2022-02-14 21:19:52,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:52,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214280637] [2022-02-14 21:19:52,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:52,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:52,979 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-02-14 21:19:52,979 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:52,988 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:52,998 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:53,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:53,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:53,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:53,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214280637] [2022-02-14 21:19:53,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214280637] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:53,297 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630368906] [2022-02-14 21:19:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:53,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:53,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:53,298 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:19:53,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-02-14 21:19:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:53,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:19:53,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:19:53,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:19:53,613 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630368906] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:19:53,613 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:19:53,613 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-02-14 21:19:53,613 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628597393] [2022-02-14 21:19:53,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:19:53,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:19:53,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:53,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:19:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-02-14 21:19:53,614 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:53,746 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-02-14 21:19:53,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:19:53,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:19:53,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:53,747 INFO L225 Difference]: With dead ends: 54 [2022-02-14 21:19:53,747 INFO L226 Difference]: Without dead ends: 51 [2022-02-14 21:19:53,747 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-02-14 21:19:53,748 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:53,748 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 71 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-14 21:19:53,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-14 21:19:53,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-02-14 21:19:53,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-02-14 21:19:53,750 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-02-14 21:19:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:53,750 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-02-14 21:19:53,750 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-02-14 21:19:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:19:53,751 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:53,751 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:19:53,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-02-14 21:19:53,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:53,968 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-02-14 21:19:53,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:53,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434928296] [2022-02-14 21:19:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:53,972 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-02-14 21:19:53,973 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:53,993 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:53,996 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:54,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:54,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:54,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434928296] [2022-02-14 21:19:54,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434928296] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:54,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295645316] [2022-02-14 21:19:54,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:54,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:54,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:54,370 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:19:54,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-02-14 21:19:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:54,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:19:54,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:19:54,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:20:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:20:09,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295645316] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:20:09,997 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:20:09,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-02-14 21:20:09,998 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608990081] [2022-02-14 21:20:09,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:20:09,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-14 21:20:09,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:20:09,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-14 21:20:09,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=300, Unknown=4, NotChecked=0, Total=380 [2022-02-14 21:20:09,998 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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-02-14 21:20:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:20:11,225 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-02-14 21:20:11,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-14 21:20:11,225 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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 19 [2022-02-14 21:20:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:20:11,226 INFO L225 Difference]: With dead ends: 62 [2022-02-14 21:20:11,226 INFO L226 Difference]: Without dead ends: 58 [2022-02-14 21:20:11,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=195, Invalid=731, Unknown=4, NotChecked=0, Total=930 [2022-02-14 21:20:11,226 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-14 21:20:11,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 65 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 126 Invalid, 0 Unknown, 33 Unchecked, 0.3s Time] [2022-02-14 21:20:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-14 21:20:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-02-14 21:20:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:11,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-02-14 21:20:11,229 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-02-14 21:20:11,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:20:11,229 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-02-14 21:20:11,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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-02-14 21:20:11,229 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-02-14 21:20:11,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:20:11,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:20:11,229 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:20:11,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-02-14 21:20:11,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-14 21:20:11,435 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:20:11,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:20:11,436 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-02-14 21:20:11,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:20:11,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580365404] [2022-02-14 21:20:11,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:11,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:20:11,439 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-02-14 21:20:11,440 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:11,447 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:11,450 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:11,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:20:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:11,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:11,818 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:20:11,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580365404] [2022-02-14 21:20:11,818 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580365404] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:20:11,818 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778583724] [2022-02-14 21:20:11,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:11,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:11,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:20:11,819 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:20:11,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-14 21:20:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:11,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:20:11,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:20:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:20:12,246 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:20:12,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778583724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:20:12,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:20:12,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-02-14 21:20:12,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787357304] [2022-02-14 21:20:12,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:20:12,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:20:12,247 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:20:12,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:20:12,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:20:12,247 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:20:12,406 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2022-02-14 21:20:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:20:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:20:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:20:12,406 INFO L225 Difference]: With dead ends: 51 [2022-02-14 21:20:12,406 INFO L226 Difference]: Without dead ends: 48 [2022-02-14 21:20:12,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:20:12,407 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:20:12,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 89 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 12 Unchecked, 0.1s Time] [2022-02-14 21:20:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-14 21:20:12,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-02-14 21:20:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:12,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-02-14 21:20:12,409 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-02-14 21:20:12,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:20:12,409 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-02-14 21:20:12,409 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:12,409 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-02-14 21:20:12,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:20:12,410 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:20:12,410 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:20:12,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-02-14 21:20:12,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-14 21:20:12,619 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:20:12,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:20:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash -949517359, now seen corresponding path program 1 times [2022-02-14 21:20:12,620 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:20:12,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102083751] [2022-02-14 21:20:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:20:12,623 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-02-14 21:20:12,624 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-02-14 21:20:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:12,643 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:12,646 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-02-14 21:20:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:20:12,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:20:12,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:20:12,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102083751] [2022-02-14 21:20:12,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102083751] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:20:12,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646497155] [2022-02-14 21:20:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:12,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:12,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:20:12,922 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:20:12,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-14 21:20:12,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:12,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:20:12,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:20:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:20:13,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:20:13,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646497155] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:20:13,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:20:13,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-02-14 21:20:13,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699484017] [2022-02-14 21:20:13,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:20:13,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-14 21:20:13,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:20:13,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-14 21:20:13,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-02-14 21:20:13,276 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:20:13,408 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-02-14 21:20:13,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:20:13,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:20:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:20:13,409 INFO L225 Difference]: With dead ends: 54 [2022-02-14 21:20:13,409 INFO L226 Difference]: Without dead ends: 51 [2022-02-14 21:20:13,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:20:13,409 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:20:13,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-02-14 21:20:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-14 21:20:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-02-14 21:20:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-02-14 21:20:13,411 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-02-14 21:20:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:20:13,412 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-02-14 21:20:13,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-02-14 21:20:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:20:13,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:20:13,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:20:13,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-14 21:20:13,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:13,629 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:20:13,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:20:13,629 INFO L85 PathProgramCache]: Analyzing trace with hash -593960234, now seen corresponding path program 1 times [2022-02-14 21:20:13,629 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:20:13,629 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031307179] [2022-02-14 21:20:13,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:13,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:20:13,632 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-02-14 21:20:13,633 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:13,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:13,642 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-02-14 21:20:13,646 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:14,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:20:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:14,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:14,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:20:14,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031307179] [2022-02-14 21:20:14,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031307179] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:20:14,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712563391] [2022-02-14 21:20:14,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:14,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:14,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:20:14,042 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:20:14,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-14 21:20:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:14,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:20:14,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:20:15,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:20:15,031 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:20:17,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:20:17,804 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712563391] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:20:17,804 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:20:17,804 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2022-02-14 21:20:17,804 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204345460] [2022-02-14 21:20:17,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:20:17,805 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-14 21:20:17,805 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:20:17,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-14 21:20:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2022-02-14 21:20:17,805 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:22,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:20:22,772 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-02-14 21:20:22,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-14 21:20:22,772 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:20:22,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:20:22,773 INFO L225 Difference]: With dead ends: 62 [2022-02-14 21:20:22,773 INFO L226 Difference]: Without dead ends: 59 [2022-02-14 21:20:22,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=166, Invalid=588, Unknown=2, NotChecked=0, Total=756 [2022-02-14 21:20:22,773 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 69 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:20:22,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 79 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 110 Invalid, 0 Unknown, 40 Unchecked, 0.2s Time] [2022-02-14 21:20:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-14 21:20:22,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2022-02-14 21:20:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-02-14 21:20:22,778 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-02-14 21:20:22,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:20:22,778 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-02-14 21:20:22,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:22,778 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-02-14 21:20:22,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:20:22,778 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:20:22,778 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:20:22,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-14 21:20:22,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:22,983 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:20:22,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:20:22,984 INFO L85 PathProgramCache]: Analyzing trace with hash 629018289, now seen corresponding path program 1 times [2022-02-14 21:20:22,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:20:22,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12562268] [2022-02-14 21:20:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:20:22,987 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-02-14 21:20:22,988 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:22,996 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-02-14 21:20:23,000 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:23,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:20:23,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:23,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:20:23,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12562268] [2022-02-14 21:20:23,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12562268] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:20:23,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603963104] [2022-02-14 21:20:23,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:23,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:23,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:20:23,358 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:20:23,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-14 21:20:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:23,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 21:20:23,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:20:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:24,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:20:36,346 WARN L228 SmtUtils]: Spent 8.23s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:20:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:40,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603963104] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:20:40,278 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:20:40,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2022-02-14 21:20:40,278 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67550709] [2022-02-14 21:20:40,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:20:40,278 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-14 21:20:40,278 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:20:40,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-14 21:20:40,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=329, Unknown=1, NotChecked=0, Total=420 [2022-02-14 21:20:40,279 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:40,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:20:40,742 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2022-02-14 21:20:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-14 21:20:40,742 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:20:40,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:20:40,743 INFO L225 Difference]: With dead ends: 55 [2022-02-14 21:20:40,743 INFO L226 Difference]: Without dead ends: 52 [2022-02-14 21:20:40,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=167, Invalid=588, Unknown=1, NotChecked=0, Total=756 [2022-02-14 21:20:40,743 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 56 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:20:40,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 47 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 35 Unchecked, 0.2s Time] [2022-02-14 21:20:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-14 21:20:40,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-02-14 21:20:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:40,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-02-14 21:20:40,745 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-02-14 21:20:40,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:20:40,745 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-02-14 21:20:40,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:40,745 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-02-14 21:20:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:20:40,746 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:20:40,746 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:20:40,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-14 21:20:40,951 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:40,951 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:20:40,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:20:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005366, now seen corresponding path program 1 times [2022-02-14 21:20:40,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:20:40,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281948159] [2022-02-14 21:20:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:40,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:20:40,955 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-02-14 21:20:40,955 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:40,963 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-02-14 21:20:40,966 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-02-14 21:20:41,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:20:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:41,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:41,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:20:41,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281948159] [2022-02-14 21:20:41,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281948159] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:20:41,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922001621] [2022-02-14 21:20:41,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:41,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:41,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:20:41,292 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:20:41,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-02-14 21:20:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:41,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 21:20:41,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:20:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:42,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:20:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:50,289 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922001621] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:20:50,289 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:20:50,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-02-14 21:20:50,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355298619] [2022-02-14 21:20:50,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:20:50,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-14 21:20:50,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:20:50,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-14 21:20:50,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=272, Unknown=2, NotChecked=0, Total=342 [2022-02-14 21:20:50,290 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:53,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:20:53,238 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2022-02-14 21:20:53,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-14 21:20:53,238 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:20:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:20:53,239 INFO L225 Difference]: With dead ends: 63 [2022-02-14 21:20:53,239 INFO L226 Difference]: Without dead ends: 59 [2022-02-14 21:20:53,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=148, Invalid=551, Unknown=3, NotChecked=0, Total=702 [2022-02-14 21:20:53,239 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 42 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:20:53,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 75 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 123 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-02-14 21:20:53,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-14 21:20:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2022-02-14 21:20:53,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:53,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2022-02-14 21:20:53,241 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 19 [2022-02-14 21:20:53,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:20:53,241 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2022-02-14 21:20:53,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:20:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2022-02-14 21:20:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:20:53,242 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:20:53,242 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:20:53,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-02-14 21:20:53,451 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-14 21:20:53,452 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:20:53,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:20:53,452 INFO L85 PathProgramCache]: Analyzing trace with hash -405199023, now seen corresponding path program 1 times [2022-02-14 21:20:53,452 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:20:53,452 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827855689] [2022-02-14 21:20:53,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:53,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:20:53,455 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-02-14 21:20:53,456 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-02-14 21:20:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:53,463 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-02-14 21:20:53,466 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-02-14 21:20:53,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:20:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:20:53,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:20:53,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827855689] [2022-02-14 21:20:53,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827855689] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:20:53,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960701084] [2022-02-14 21:20:53,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:20:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:20:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:20:53,817 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:20:53,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-02-14 21:20:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:20:53,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:20:53,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:20:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:20:56,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:21:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:21:09,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960701084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:21:09,677 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:21:09,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-02-14 21:21:09,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577586476] [2022-02-14 21:21:09,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:21:09,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-14 21:21:09,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:21:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-14 21:21:09,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=331, Unknown=3, NotChecked=0, Total=420 [2022-02-14 21:21:09,679 INFO L87 Difference]: Start difference. First operand 46 states and 74 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:21:16,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:21:16,247 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2022-02-14 21:21:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-02-14 21:21:16,248 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:21:16,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:21:16,248 INFO L225 Difference]: With dead ends: 72 [2022-02-14 21:21:16,248 INFO L226 Difference]: Without dead ends: 68 [2022-02-14 21:21:16,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=268, Invalid=919, Unknown=3, NotChecked=0, Total=1190 [2022-02-14 21:21:16,249 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:21:16,249 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 60 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2022-02-14 21:21:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-14 21:21:16,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 50. [2022-02-14 21:21:16,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.711111111111111) internal successors, (77), 45 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:21:16,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 81 transitions. [2022-02-14 21:21:16,251 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 81 transitions. Word has length 19 [2022-02-14 21:21:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:21:16,251 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 81 transitions. [2022-02-14 21:21:16,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:21:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 81 transitions. [2022-02-14 21:21:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:21:16,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:21:16,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:21:16,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-02-14 21:21:16,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-02-14 21:21:16,463 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:21:16,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:21:16,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2144376817, now seen corresponding path program 1 times [2022-02-14 21:21:16,464 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:21:16,464 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740155960] [2022-02-14 21:21:16,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:21:16,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:21:16,467 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-02-14 21:21:16,467 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-02-14 21:21:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:21:16,482 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-02-14 21:21:16,485 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-02-14 21:21:16,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:21:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:21:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:21:16,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:21:16,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740155960] [2022-02-14 21:21:16,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740155960] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:21:16,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252581559] [2022-02-14 21:21:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:21:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:21:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:21:16,875 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:21:16,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-02-14 21:21:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:21:16,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-14 21:21:16,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:21:19,622 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse3 (< 0 c_main_~y~0)) (.cse4 (< 0 .cse6)) (.cse5 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1))))) (.cse2 (mod c_main_~y~0 4294967296))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 .cse2) .cse3 .cse4 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse5 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse6 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse3 .cse4 .cse5)) (<= .cse2 0) (= c_main_~y~0 c_main_~z~0))))) is different from false [2022-02-14 21:21:21,781 WARN L838 $PredicateComparison]: unable to prove that (and (not (< 0 (mod c_main_~z~0 4294967296))) (let ((.cse5 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse2 (< 0 c_main_~y~0)) (.cse3 (< 0 .cse5)) (.cse4 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1)))))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 (mod c_main_~y~0 4294967296)) .cse2 .cse3 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse4 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse5 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse2 .cse3 .cse4)) (= c_main_~y~0 c_main_~z~0)))))) is different from false [2022-02-14 21:21:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-14 21:21:22,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:21:45,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:21:45,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252581559] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:21:45,562 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:21:45,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-02-14 21:21:45,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392819408] [2022-02-14 21:21:45,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:21:45,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-14 21:21:45,563 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:21:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-14 21:21:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=427, Unknown=8, NotChecked=90, Total=650 [2022-02-14 21:21:45,563 INFO L87 Difference]: Start difference. First operand 50 states and 81 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:21:47,992 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse6 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse3 (< 0 c_main_~y~0)) (.cse4 (< 0 .cse6)) (.cse5 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1))))) (.cse2 (mod c_main_~y~0 4294967296))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 .cse2) .cse3 .cse4 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse5 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse6 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse3 .cse4 .cse5)) (<= .cse2 0) (= c_main_~y~0 c_main_~z~0))))) (or (< (+ (* (div c_main_~z~0 4294967296) 4294967296) c_main_~n~0) (+ (* (div c_main_~n~0 4294967296) 4294967296) c_main_~z~0 1)) (<= (+ (* 4294967296 (div c_main_~y~0 4294967296)) 1) c_main_~y~0))) is different from false [2022-02-14 21:21:50,044 WARN L838 $PredicateComparison]: unable to prove that (and (not (< 0 (mod c_main_~z~0 4294967296))) (let ((.cse5 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse2 (< 0 c_main_~y~0)) (.cse3 (< 0 .cse5)) (.cse4 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1)))))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 (mod c_main_~y~0 4294967296)) .cse2 .cse3 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse4 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse5 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse2 .cse3 .cse4)) (= c_main_~y~0 c_main_~z~0))))) (or (let ((.cse7 (* (div c_main_~n~0 4294967296) 4294967296)) (.cse6 (+ (* (div c_main_~z~0 4294967296) 4294967296) c_main_~n~0))) (and (< .cse6 (+ .cse7 c_main_~z~0 1)) (<= (+ .cse7 c_main_~z~0) .cse6))) (<= (+ (* 4294967296 (div c_main_~y~0 4294967296)) 1) c_main_~y~0))) is different from false [2022-02-14 21:22:15,630 WARN L228 SmtUtils]: Spent 15.24s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:22:57,216 WARN L228 SmtUtils]: Spent 30.83s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:23:21,069 WARN L228 SmtUtils]: Spent 17.67s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:23:42,805 WARN L228 SmtUtils]: Spent 16.65s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:23:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:23:43,501 INFO L93 Difference]: Finished difference Result 77 states and 127 transitions. [2022-02-14 21:23:43,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-14 21:23:43,501 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:23:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:23:43,501 INFO L225 Difference]: With dead ends: 77 [2022-02-14 21:23:43,501 INFO L226 Difference]: Without dead ends: 73 [2022-02-14 21:23:43,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 142.7s TimeCoverageRelationStatistics Valid=344, Invalid=1129, Unknown=25, NotChecked=308, Total=1806 [2022-02-14 21:23:43,502 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:23:43,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 72 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 117 Invalid, 0 Unknown, 150 Unchecked, 0.2s Time] [2022-02-14 21:23:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-14 21:23:43,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 52. [2022-02-14 21:23:43,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:23:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2022-02-14 21:23:43,504 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 19 [2022-02-14 21:23:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:23:43,504 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2022-02-14 21:23:43,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:23:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2022-02-14 21:23:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:23:43,505 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:23:43,505 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:23:43,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-02-14 21:23:43,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:23:43,708 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:23:43,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:23:43,709 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 2 times [2022-02-14 21:23:43,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:23:43,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866670127] [2022-02-14 21:23:43,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:23:43,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:23:43,712 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:23:43,712 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:23:43,713 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:23:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:23:43,721 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:23:43,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:23:43,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:23:44,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:23:44,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:23:44,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:23:44,041 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:23:44,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866670127] [2022-02-14 21:23:44,041 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866670127] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:23:44,041 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524488821] [2022-02-14 21:23:44,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:23:44,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:23:44,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:23:44,043 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:23:44,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-02-14 21:23:44,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:23:44,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:23:44,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 21:23:44,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:23:44,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:23:44,442 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:23:46,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_65_31 Int)) (or (>= aux_mod_v_main_~z~0_65_31 4294967296) (> 0 aux_mod_v_main_~z~0_65_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_65_31 Int)) (not (= (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)) c_main_~z~0)))) (or (forall ((aux_div_v_main_~z~0_65_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)))))) (not .cse0)))) (= aux_mod_v_main_~z~0_65_31 (mod c_main_~n~0 4294967296)))) is different from false [2022-02-14 21:23:51,229 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_65_31 Int)) (or (>= aux_mod_v_main_~z~0_65_31 4294967296) (> 0 aux_mod_v_main_~z~0_65_31) (= aux_mod_v_main_~z~0_65_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_65_31 Int)) (not (= (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)) c_main_~z~0)))) (or (and (or (forall ((aux_div_v_main_~z~0_65_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_65_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~z~0_65_31 Int) (aux_div_v_main_~y~0_65_31 Int) (aux_mod_v_main_~y~0_65_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_65_31 4294967296))) (or (<= aux_mod_v_main_~y~0_65_31 0) (<= (+ aux_mod_v_main_~z~0_65_31 .cse1 (* 4294967296 aux_div_v_main_~z~0_65_31) aux_mod_v_main_~y~0_65_31) (+ c_main_~y~0 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_65_31 4294967296) aux_mod_v_main_~y~0_65_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_65_31)) (<= 4294967296 aux_mod_v_main_~y~0_65_31) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_65_31 (* aux_div_v_main_~y~0_65_31 4294967296) (* 4294967296 aux_div_v_main_~z~0_65_31) aux_mod_v_main_~y~0_65_31)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_65_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6))))))) (not .cse0)))))) is different from false [2022-02-14 21:24:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-02-14 21:24:38,267 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524488821] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:24:38,267 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:24:38,267 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2022-02-14 21:24:38,267 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488384618] [2022-02-14 21:24:38,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:24:38,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-14 21:24:38,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:24:38,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-14 21:24:38,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=289, Unknown=10, NotChecked=74, Total=462 [2022-02-14 21:24:38,268 INFO L87 Difference]: Start difference. First operand 52 states and 85 transitions. Second operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 19 states have internal predecessors, (38), 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-02-14 21:24:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:24:40,813 INFO L93 Difference]: Finished difference Result 69 states and 112 transitions. [2022-02-14 21:24:40,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-14 21:24:40,813 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 19 states have internal predecessors, (38), 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 20 [2022-02-14 21:24:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:24:40,814 INFO L225 Difference]: With dead ends: 69 [2022-02-14 21:24:40,814 INFO L226 Difference]: Without dead ends: 63 [2022-02-14 21:24:40,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 31.5s TimeCoverageRelationStatistics Valid=150, Invalid=497, Unknown=11, NotChecked=98, Total=756 [2022-02-14 21:24:40,814 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:24:40,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 86 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 114 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-02-14 21:24:40,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-14 21:24:40,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2022-02-14 21:24:40,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 49 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:24:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2022-02-14 21:24:40,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 88 transitions. Word has length 20 [2022-02-14 21:24:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:24:40,816 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 88 transitions. [2022-02-14 21:24:40,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 19 states have internal predecessors, (38), 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-02-14 21:24:40,816 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 88 transitions. [2022-02-14 21:24:40,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:24:40,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:24:40,816 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:24:40,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-02-14 21:24:41,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:24:41,023 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:24:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:24:41,024 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-02-14 21:24:41,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:24:41,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732412914] [2022-02-14 21:24:41,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:24:41,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:24:41,029 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:24:41,030 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:24:41,030 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:24:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:24:41,039 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:24:41,041 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:24:41,042 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:24:41,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:24:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:24:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:24:41,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:24:41,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732412914] [2022-02-14 21:24:41,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732412914] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:24:41,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528367329] [2022-02-14 21:24:41,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:24:41,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:24:41,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:24:41,438 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:24:41,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-02-14 21:24:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:24:41,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:24:41,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:24:41,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-14 21:24:41,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:24:44,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_71_31 Int)) (or (>= aux_mod_v_main_~z~0_71_31 4294967296) (> 0 aux_mod_v_main_~z~0_71_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~z~0_71_31 Int)) (or (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_71_31) aux_mod_v_main_~z~0_71_31)) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_71_31) aux_mod_v_main_~z~0_71_31)))))) (or .cse0 (forall ((aux_div_v_main_~z~0_71_31 Int)) (not (= c_main_~z~0 (+ (* 4294967296 aux_div_v_main_~z~0_71_31) aux_mod_v_main_~z~0_71_31))))))) (= aux_mod_v_main_~z~0_71_31 (mod c_main_~n~0 4294967296)))) is different from false [2022-02-14 21:24:53,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-02-14 21:24:53,413 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528367329] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:24:53,413 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:24:53,413 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-02-14 21:24:53,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509502154] [2022-02-14 21:24:53,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:24:53,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-14 21:24:53,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:24:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-14 21:24:53,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=4, NotChecked=40, Total=506 [2022-02-14 21:24:53,414 INFO L87 Difference]: Start difference. First operand 54 states and 88 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 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-02-14 21:25:07,123 WARN L228 SmtUtils]: Spent 10.46s on a formula simplification. DAG size of input: 53 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:25:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:25:07,599 INFO L93 Difference]: Finished difference Result 81 states and 129 transitions. [2022-02-14 21:25:07,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-14 21:25:07,599 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 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 20 [2022-02-14 21:25:07,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:25:07,600 INFO L225 Difference]: With dead ends: 81 [2022-02-14 21:25:07,600 INFO L226 Difference]: Without dead ends: 77 [2022-02-14 21:25:07,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=4, NotChecked=64, Total=1190 [2022-02-14 21:25:07,600 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-14 21:25:07,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 98 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 151 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2022-02-14 21:25:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-14 21:25:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 53. [2022-02-14 21:25:07,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 48 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:25:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 87 transitions. [2022-02-14 21:25:07,602 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 87 transitions. Word has length 20 [2022-02-14 21:25:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:25:07,602 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 87 transitions. [2022-02-14 21:25:07,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 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-02-14 21:25:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 87 transitions. [2022-02-14 21:25:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:25:07,603 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:25:07,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:25:07,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-02-14 21:25:07,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-02-14 21:25:07,819 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:25:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:25:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-02-14 21:25:07,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:25:07,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475443587] [2022-02-14 21:25:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:25:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:25:07,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:07,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:25:07,823 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:07,832 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:07,833 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:25:07,835 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:08,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:25:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:25:08,147 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:25:08,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475443587] [2022-02-14 21:25:08,147 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475443587] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:25:08,147 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12627122] [2022-02-14 21:25:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:25:08,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:25:08,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:25:08,148 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:25:08,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-02-14 21:25:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:08,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-14 21:25:08,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:25:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:25:08,604 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:25:44,693 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_77_31 Int) (aux_mod_main_~z~0_26 Int)) (or (< aux_mod_v_main_~z~0_77_31 0) (< 0 aux_mod_main_~z~0_26) (= aux_mod_v_main_~z~0_77_31 (mod c_main_~n~0 4294967296)) (<= 4294967296 aux_mod_v_main_~z~0_77_31) (< aux_mod_main_~z~0_26 0) (and (or (forall ((aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (not (= (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26)) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))))) (forall ((aux_mod_v_main_~y~0_75_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_75_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not .cse0)) (or .cse0 (forall ((aux_div_v_main_~y~0_75_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31) c_main_~y~0)))))) (< aux_mod_v_main_~y~0_75_31 0) (< 0 aux_mod_v_main_~y~0_75_31)))) (forall ((aux_mod_v_main_~y~0_75_31 Int) (aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (or (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_75_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not .cse1)) (or .cse1 (forall ((aux_div_v_main_~y~0_75_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31) c_main_~y~0)))))) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_75_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_main_~z~0_26 v_it_6 (* 4294967296 aux_div_main_~z~0_26) 1) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_75_31 0) (<= 4294967296 aux_mod_v_main_~y~0_75_31) (<= (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31)) (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26)))))))) is different from false [2022-02-14 21:25:58,364 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_main_~y~0_26 Int) (aux_mod_v_main_~z~0_77_31 Int) (aux_mod_main_~z~0_26 Int)) (or (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (and (or (forall ((aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (not (= (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26)) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))))) (forall ((aux_mod_v_main_~y~0_75_31 Int)) (or (< aux_mod_v_main_~y~0_75_31 0) (< 0 aux_mod_v_main_~y~0_75_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int)) (not (= (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)))))) (or (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (<= 1 v_it_4))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))))) (not .cse0))))))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_mod_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int) (aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (or (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_75_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_main_~z~0_26 v_it_6 (* 4294967296 aux_div_main_~z~0_26) 1) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_75_31 0) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (<= 1 v_it_4))) (<= 4294967296 aux_mod_v_main_~y~0_75_31) (<= (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31)) (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))))))) (< aux_mod_v_main_~z~0_77_31 0) (< 0 aux_mod_main_~z~0_26) (= aux_mod_v_main_~z~0_77_31 (mod c_main_~n~0 4294967296)) (<= 4294967296 aux_mod_v_main_~z~0_77_31) (< aux_mod_main_~z~0_26 0))) is different from false [2022-02-14 21:26:00,387 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_main_~y~0_26 Int) (aux_mod_v_main_~z~0_77_31 Int) (aux_mod_main_~z~0_26 Int)) (or (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (and (or (forall ((aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (not (= (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26)) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))))) (forall ((aux_mod_v_main_~y~0_75_31 Int)) (or (< aux_mod_v_main_~y~0_75_31 0) (< 0 aux_mod_v_main_~y~0_75_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int)) (not (= (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)))))) (or (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (<= 1 v_it_4))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))))) (not .cse0))))))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_mod_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int) (aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (or (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_75_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_main_~z~0_26 v_it_6 (* 4294967296 aux_div_main_~z~0_26) 1) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_75_31 0) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (<= 1 v_it_4))) (<= 4294967296 aux_mod_v_main_~y~0_75_31) (<= (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31)) (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))))))) (< aux_mod_v_main_~z~0_77_31 0) (< 0 aux_mod_main_~z~0_26) (= aux_mod_v_main_~z~0_77_31 (mod c_main_~n~0 4294967296)) (<= 4294967296 aux_mod_v_main_~z~0_77_31) (< aux_mod_main_~z~0_26 0))) is different from true [2022-02-14 21:26:23,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-02-14 21:26:23,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12627122] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:26:23,300 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:26:23,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-02-14 21:26:23,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957475642] [2022-02-14 21:26:23,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:26:23,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-14 21:26:23,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:26:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-14 21:26:23,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=361, Unknown=10, NotChecked=82, Total=552 [2022-02-14 21:26:23,302 INFO L87 Difference]: Start difference. First operand 53 states and 87 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 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-02-14 21:26:30,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:26:30,422 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2022-02-14 21:26:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-14 21:26:30,423 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 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 20 [2022-02-14 21:26:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:26:30,423 INFO L225 Difference]: With dead ends: 70 [2022-02-14 21:26:30,423 INFO L226 Difference]: Without dead ends: 67 [2022-02-14 21:26:30,424 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 28.5s TimeCoverageRelationStatistics Valid=186, Invalid=682, Unknown=10, NotChecked=114, Total=992 [2022-02-14 21:26:30,424 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:26:30,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 78 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 106 Invalid, 0 Unknown, 96 Unchecked, 0.2s Time] [2022-02-14 21:26:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-14 21:26:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-02-14 21:26:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.74) internal successors, (87), 50 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:26:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 91 transitions. [2022-02-14 21:26:30,426 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 91 transitions. Word has length 20 [2022-02-14 21:26:30,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:26:30,426 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 91 transitions. [2022-02-14 21:26:30,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 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-02-14 21:26:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-02-14 21:26:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:26:30,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:26:30,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:26:30,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-02-14 21:26:30,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-02-14 21:26:30,627 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:26:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:26:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-02-14 21:26:30,627 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:26:30,627 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601403753] [2022-02-14 21:26:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:26:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:26:30,630 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:30,630 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:26:30,631 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:26:30,638 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:30,639 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:26:30,640 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:30,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:26:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:26:30,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:26:30,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:26:30,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601403753] [2022-02-14 21:26:30,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601403753] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:26:30,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164512448] [2022-02-14 21:26:30,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:26:30,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:26:30,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:26:30,959 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:26:30,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-02-14 21:26:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:26:30,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:26:30,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:26:31,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-14 21:26:31,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-14 21:26:31,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164512448] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:26:31,338 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-14 21:26:31,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-02-14 21:26:31,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346104969] [2022-02-14 21:26:31,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:26:31,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:26:31,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:26:31,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:26:31,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-02-14 21:26:31,339 INFO L87 Difference]: Start difference. First operand 55 states and 91 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:26:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:26:31,441 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2022-02-14 21:26:31,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:26:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:26:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:26:31,442 INFO L225 Difference]: With dead ends: 70 [2022-02-14 21:26:31,442 INFO L226 Difference]: Without dead ends: 67 [2022-02-14 21:26:31,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-02-14 21:26:31,442 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:26:31,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-14 21:26:31,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-14 21:26:31,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2022-02-14 21:26:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:26:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2022-02-14 21:26:31,444 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 20 [2022-02-14 21:26:31,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:26:31,444 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2022-02-14 21:26:31,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:26:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2022-02-14 21:26:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:26:31,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:26:31,444 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:26:31,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-02-14 21:26:31,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-02-14 21:26:31,645 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:26:31,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:26:31,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-02-14 21:26:31,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:26:31,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795677250] [2022-02-14 21:26:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:26:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:26:31,648 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:31,649 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:31,649 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:26:31,665 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:31,667 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:31,669 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:26:31,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:26:31,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:26:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:26:31,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:26:31,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795677250] [2022-02-14 21:26:31,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795677250] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:26:31,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705540849] [2022-02-14 21:26:31,996 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:26:31,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:26:31,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:26:31,997 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:26:31,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-02-14 21:26:32,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:26:32,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:26:32,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-14 21:26:32,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:26:32,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:26:32,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:26:50,169 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (div c_main_~n~0 4294967296)) (.cse1 (* (- 1) c_main_~z~0))) (and (< (div (+ (- 1) .cse1) (- 4294967296)) (+ (div (+ (* (- 1) c_main_~n~0) c_main_~z~0) 4294967296) .cse2 2)) (<= (+ .cse2 (div (+ .cse1 c_main_~n~0) (- 4294967296))) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1))))) (or (not .cse0) (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (and (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ c_main_~y~0 c_main_~z~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_82_31 0) (<= 4294967296 aux_mod_v_main_~y~0_82_31)))) (or (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))))) (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)))) (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (< aux_mod_v_main_~z~0_84_31 0))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ c_main_~y~0 c_main_~z~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_82_31 0) (<= 4294967296 aux_mod_v_main_~y~0_82_31)))) (or (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))))) (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))))))) is different from false [2022-02-14 21:27:30,314 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~z~0_86 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (* (- 1) v_main_~z~0_86)) (.cse1 (div c_main_~n~0 4294967296))) (and (<= (+ .cse1 (div (+ c_main_~n~0 .cse2) (- 4294967296))) (+ (div (+ v_main_~z~0_86 (- 4294967296)) 4294967296) 1)) (< (div (+ (- 1) .cse2) (- 4294967296)) (+ .cse1 2 (div (+ v_main_~z~0_86 (* (- 1) c_main_~n~0)) 4294967296)))))) (or (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (< aux_mod_v_main_~z~0_84_31 0)))) (not .cse0)))) (let ((.cse5 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse5) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~z~0_86 v_it_5 1) c_main_~z~0))) (not (< v_main_~z~0_86 c_main_~z~0))) (or .cse5 (not (= v_main_~z~0_86 c_main_~z~0))))))) is different from false [2022-02-14 21:27:32,323 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~z~0_86 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (* (- 1) v_main_~z~0_86)) (.cse1 (div c_main_~n~0 4294967296))) (and (<= (+ .cse1 (div (+ c_main_~n~0 .cse2) (- 4294967296))) (+ (div (+ v_main_~z~0_86 (- 4294967296)) 4294967296) 1)) (< (div (+ (- 1) .cse2) (- 4294967296)) (+ .cse1 2 (div (+ v_main_~z~0_86 (* (- 1) c_main_~n~0)) 4294967296)))))) (or (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (< aux_mod_v_main_~z~0_84_31 0)))) (not .cse0)))) (let ((.cse5 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse5) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~z~0_86 v_it_5 1) c_main_~z~0))) (not (< v_main_~z~0_86 c_main_~z~0))) (or .cse5 (not (= v_main_~z~0_86 c_main_~z~0))))))) is different from true [2022-02-14 21:28:28,549 WARN L228 SmtUtils]: Spent 17.04s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:28:37,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-02-14 21:28:37,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705540849] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:28:37,099 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:28:37,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 20 [2022-02-14 21:28:37,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415714171] [2022-02-14 21:28:37,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:28:37,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-14 21:28:37,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:28:37,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-14 21:28:37,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=233, Unknown=10, NotChecked=66, Total=380 [2022-02-14 21:28:37,100 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:28:39,339 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0) (= c_main_~z~0 0) (forall ((v_main_~z~0_86 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (* (- 1) v_main_~z~0_86)) (.cse1 (div c_main_~n~0 4294967296))) (and (<= (+ .cse1 (div (+ c_main_~n~0 .cse2) (- 4294967296))) (+ (div (+ v_main_~z~0_86 (- 4294967296)) 4294967296) 1)) (< (div (+ (- 1) .cse2) (- 4294967296)) (+ .cse1 2 (div (+ v_main_~z~0_86 (* (- 1) c_main_~n~0)) 4294967296)))))) (or (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (< aux_mod_v_main_~z~0_84_31 0)))) (not .cse0)))) (let ((.cse5 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse5) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~z~0_86 v_it_5 1) c_main_~z~0))) (not (< v_main_~z~0_86 c_main_~z~0))) (or .cse5 (not (= v_main_~z~0_86 c_main_~z~0))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-02-14 21:28:41,399 WARN L838 $PredicateComparison]: unable to prove that (and (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0) (= c_main_~z~0 0) (forall ((v_main_~z~0_86 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (* (- 1) v_main_~z~0_86)) (.cse1 (div c_main_~n~0 4294967296))) (and (<= (+ .cse1 (div (+ c_main_~n~0 .cse2) (- 4294967296))) (+ (div (+ v_main_~z~0_86 (- 4294967296)) 4294967296) 1)) (< (div (+ (- 1) .cse2) (- 4294967296)) (+ .cse1 2 (div (+ v_main_~z~0_86 (* (- 1) c_main_~n~0)) 4294967296)))))) (or (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (< aux_mod_v_main_~z~0_84_31 0)))) (not .cse0)))) (let ((.cse5 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse5) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~z~0_86 v_it_5 1) c_main_~z~0))) (not (< v_main_~z~0_86 c_main_~z~0))) (or .cse5 (not (= v_main_~z~0_86 c_main_~z~0)))))))) is different from false [2022-02-14 21:28:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:28:41,737 INFO L93 Difference]: Finished difference Result 68 states and 109 transitions. [2022-02-14 21:28:41,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-14 21:28:41,738 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:28:41,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:28:41,738 INFO L225 Difference]: With dead ends: 68 [2022-02-14 21:28:41,738 INFO L226 Difference]: Without dead ends: 62 [2022-02-14 21:28:41,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 45.4s TimeCoverageRelationStatistics Valid=130, Invalid=426, Unknown=12, NotChecked=188, Total=756 [2022-02-14 21:28:41,739 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-14 21:28:41,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 89 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 132 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2022-02-14 21:28:41,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-02-14 21:28:41,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 54. [2022-02-14 21:28:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.7142857142857142) internal successors, (84), 49 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:28:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 88 transitions. [2022-02-14 21:28:41,740 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 88 transitions. Word has length 20 [2022-02-14 21:28:41,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:28:41,741 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 88 transitions. [2022-02-14 21:28:41,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:28:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 88 transitions. [2022-02-14 21:28:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:28:41,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:28:41,741 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-14 21:28:41,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-02-14 21:28:41,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-02-14 21:28:41,948 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:28:41,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:28:41,948 INFO L85 PathProgramCache]: Analyzing trace with hash 641395694, now seen corresponding path program 2 times [2022-02-14 21:28:41,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:28:41,949 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825511410] [2022-02-14 21:28:41,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:28:41,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:28:41,952 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:28:41,952 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:28:41,953 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:28:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:28:41,959 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:28:41,961 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:28:41,962 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:28:42,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:28:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:28:42,272 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:28:42,272 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:28:42,272 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825511410] [2022-02-14 21:28:42,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825511410] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:28:42,273 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013619935] [2022-02-14 21:28:42,273 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:28:42,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:28:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:28:42,274 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-14 21:28:42,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-02-14 21:28:42,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:28:42,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:28:42,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-14 21:28:42,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:28:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-14 21:28:42,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:28:56,626 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (div c_main_~n~0 4294967296)) (.cse1 (* (- 1) c_main_~z~0))) (and (< (div (+ (- 1) .cse1) (- 4294967296)) (+ (div (+ (* (- 1) c_main_~n~0) c_main_~z~0) 4294967296) .cse2 2)) (<= (+ .cse2 (div (+ .cse1 c_main_~n~0) (- 4294967296))) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1))))) (or (and (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31 1)) (< aux_mod_v_main_~z~0_91_31 0) (and (or (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_88_31 4294967296))) (or (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse3) (+ c_main_~y~0 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= c_main_~y~0 (+ aux_mod_v_main_~y~0_88_31 .cse3)) (<= aux_mod_v_main_~y~0_88_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296))))))))))) (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31) c_main_~n~0) (<= 4294967296 aux_mod_v_main_~z~0_91_31) (and (or (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_88_31 4294967296))) (or (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse4) (+ c_main_~y~0 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= c_main_~y~0 (+ aux_mod_v_main_~y~0_88_31 .cse4)) (<= aux_mod_v_main_~y~0_88_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296)))))))))))) (not .cse0)))) is different from false [2022-02-14 21:28:58,657 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (div c_main_~n~0 4294967296)) (.cse1 (* (- 1) c_main_~z~0))) (and (< (div (+ (- 1) .cse1) (- 4294967296)) (+ (div (+ (* (- 1) c_main_~n~0) c_main_~z~0) 4294967296) .cse2 2)) (<= (+ .cse2 (div (+ .cse1 c_main_~n~0) (- 4294967296))) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1))))) (or (and (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31 1)) (< aux_mod_v_main_~z~0_91_31 0) (and (or (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_88_31 4294967296))) (or (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse3) (+ c_main_~y~0 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= c_main_~y~0 (+ aux_mod_v_main_~y~0_88_31 .cse3)) (<= aux_mod_v_main_~y~0_88_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296))))))))))) (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31) c_main_~n~0) (<= 4294967296 aux_mod_v_main_~z~0_91_31) (and (or (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_88_31 4294967296))) (or (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse4) (+ c_main_~y~0 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= c_main_~y~0 (+ aux_mod_v_main_~y~0_88_31 .cse4)) (<= aux_mod_v_main_~y~0_88_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296)))))))))))) (not .cse0)))) is different from true