/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-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-14 21:16:55,993 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-14 21:16:55,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-14 21:16:56,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-14 21:16:56,013 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-14 21:16:56,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-14 21:16:56,014 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-14 21:16:56,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-14 21:16:56,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-14 21:16:56,045 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-14 21:16:56,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-14 21:16:56,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-14 21:16:56,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-14 21:16:56,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-14 21:16:56,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-14 21:16:56,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-14 21:16:56,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-14 21:16:56,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-14 21:16:56,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-14 21:16:56,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-14 21:16:56,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-14 21:16:56,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-14 21:16:56,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-14 21:16:56,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-14 21:16:56,084 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-14 21:16:56,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-14 21:16:56,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-14 21:16:56,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-14 21:16:56,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-14 21:16:56,086 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-14 21:16:56,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-14 21:16:56,087 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-14 21:16:56,088 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-14 21:16:56,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-14 21:16:56,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-14 21:16:56,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-14 21:16:56,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-14 21:16:56,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-14 21:16:56,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-14 21:16:56,090 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-14 21:16:56,091 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-14 21:16:56,091 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:56,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-14 21:16:56,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-14 21:16:56,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-14 21:16:56,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-14 21:16:56,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-14 21:16:56,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-14 21:16:56,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-14 21:16:56,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-14 21:16:56,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-14 21:16:56,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-14 21:16:56,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-14 21:16:56,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-14 21:16:56,101 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-14 21:16:56,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-14 21:16:56,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-14 21:16:56,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-14 21:16:56,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-14 21:16:56,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-14 21:16:56,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:16:56,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-14 21:16:56,102 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-14 21:16:56,103 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-14 21:16:56,103 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:56,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-14 21:16:56,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-14 21:16:56,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-14 21:16:56,273 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-14 21:16:56,273 INFO L275 PluginConnector]: CDTParser initialized [2022-02-14 21:16:56,274 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-02-14 21:16:56,306 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5998e59/9a1458f02c074bd4aaa9f4896b879e11/FLAG4c1711752 [2022-02-14 21:16:56,624 INFO L306 CDTParser]: Found 1 translation units. [2022-02-14 21:16:56,624 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-02-14 21:16:56,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5998e59/9a1458f02c074bd4aaa9f4896b879e11/FLAG4c1711752 [2022-02-14 21:16:56,642 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a5998e59/9a1458f02c074bd4aaa9f4896b879e11 [2022-02-14 21:16:56,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-14 21:16:56,645 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-14 21:16:56,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-14 21:16:56,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-14 21:16:56,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-14 21:16:56,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:16:56" (1/1) ... [2022-02-14 21:16:56,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f98e59b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:56, skipping insertion in model container [2022-02-14 21:16:56,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 09:16:56" (1/1) ... [2022-02-14 21:16:56,661 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-14 21:16:56,669 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-14 21:16:56,747 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-de62.c[368,381] [2022-02-14 21:16:56,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:16:56,762 INFO L203 MainTranslator]: Completed pre-run [2022-02-14 21:16:56,775 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-de62.c[368,381] [2022-02-14 21:16:56,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-14 21:16:56,804 INFO L208 MainTranslator]: Completed translation [2022-02-14 21:16:56,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:56 WrapperNode [2022-02-14 21:16:56,807 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-14 21:16:56,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-14 21:16:56,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-14 21:16:56,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-14 21:16:56,825 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:56" (1/1) ... [2022-02-14 21:16:56,825 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:56" (1/1) ... [2022-02-14 21:16:56,829 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:56" (1/1) ... [2022-02-14 21:16:56,829 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:56" (1/1) ... [2022-02-14 21:16:56,844 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:56" (1/1) ... [2022-02-14 21:16:56,847 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:56" (1/1) ... [2022-02-14 21:16:56,848 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:56" (1/1) ... [2022-02-14 21:16:56,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-14 21:16:56,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-14 21:16:56,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-14 21:16:56,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-14 21:16:56,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:56" (1/1) ... [2022-02-14 21:16:56,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-14 21:16:56,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:56,915 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:56,932 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,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-14 21:16:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-14 21:16:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-14 21:16:56,942 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-14 21:16:56,943 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-14 21:16:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-14 21:16:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-14 21:16:56,943 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-14 21:16:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-14 21:16:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-02-14 21:16:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-14 21:16:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-14 21:16:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-14 21:16:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-14 21:16:56,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-14 21:16:56,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-14 21:16:56,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-14 21:16:56,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-14 21:16:56,996 INFO L234 CfgBuilder]: Building ICFG [2022-02-14 21:16:56,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-14 21:16:57,083 INFO L275 CfgBuilder]: Performing block encoding [2022-02-14 21:16:57,087 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-14 21:16:57,087 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-14 21:16:57,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:16:57 BoogieIcfgContainer [2022-02-14 21:16:57,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-14 21:16:57,088 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-14 21:16:57,089 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-14 21:16:57,089 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-14 21:16:57,093 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:16:57" (1/1) ... [2022-02-14 21:16:57,234 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:57,235 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_8 (+ v_main_~y~0_9 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_6, 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_7 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_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~x~0_7 v_main_~x~0_6)) (and (< 0 .cse0) (= v_main_~x~0_6 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_7 v_main_~y~0_9)) (< v_main_~y~0_9 v_main_~y~0_8) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_7 (* 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))))))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_7, 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_6, 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:57,322 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:57,323 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_8 (+ v_main_~z~0_7 1)) (< 0 (mod v_main_~z~0_8 4294967296)) (= v_main_~x~0_11 (+ v_main_~x~0_12 1))) InVars {main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_8} OutVars{main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_7, 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_8 4294967296))) (or (and (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_8 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_7 v_it_2 1) v_main_~z~0_8)) (not (<= 1 v_it_2)))) (= v_main_~x~0_11 (+ v_main_~x~0_12 v_main_~z~0_8 (* (- 1) v_main_~z~0_7))) (< 0 .cse0) (< v_main_~z~0_7 v_main_~z~0_8)) (and (<= .cse0 0) (= v_main_~z~0_8 v_main_~z~0_7) (= v_main_~x~0_12 v_main_~x~0_11) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)))) InVars {main_~x~0=v_main_~x~0_12, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_8, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_7, 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:57,388 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:57,388 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:57,477 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:57,477 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~x~0_10 4294967296)) (= v_main_~x~0_10 (+ v_main_~x~0_9 1)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_9, 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_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~x~0_10 v_main_~x~0_9)) (and (= (+ v_main_~x~0_10 v_main_~y~0_11 (* (- 1) v_main_~x~0_9)) v_main_~y~0_10) (< 0 .cse0) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_10) 4294967296)) (not (<= (+ v_main_~x~0_9 v_it_4 1) v_main_~x~0_10)) (not (<= 1 v_it_4)))) (< v_main_~x~0_9 v_main_~x~0_10)))) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10, 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_9, 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:57,563 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:57,564 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, 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_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= v_main_~x~0_14 v_main_~x~0_13) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)) (and (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~z~0_9 v_it_5 1) v_main_~z~0_10)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (< v_main_~z~0_9 v_main_~z~0_10) (= v_main_~x~0_13 (+ v_main_~x~0_14 v_main_~z~0_10 (* (- 1) v_main_~z~0_9)))))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, 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:57,627 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:57,627 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_~x~0_3 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_2, 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_~x~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_~x~0_3 v_main_~x~0_2) (<= .cse0 0)) (and (< 0 .cse0) (= v_main_~y~0_6 (+ v_main_~x~0_2 v_main_~y~0_7 (* (- 1) v_main_~x~0_3))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_2 v_it_6 1) v_main_~x~0_3)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~y~0_7 (* v_it_6 4294967295)) 4294967296)))) (< v_main_~x~0_2 v_main_~x~0_3)))) 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_~x~0=v_main_~x~0_3} 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_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post15, main_#t~post16, main_~y~0] [2022-02-14 21:16:57,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:16:57 BasicIcfg [2022-02-14 21:16:57,631 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-14 21:16:57,633 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-14 21:16:57,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-14 21:16:57,634 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-14 21:16:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 09:16:56" (1/4) ... [2022-02-14 21:16:57,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcb18aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:16:57, skipping insertion in model container [2022-02-14 21:16:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 09:16:56" (2/4) ... [2022-02-14 21:16:57,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcb18aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 09:16:57, skipping insertion in model container [2022-02-14 21:16:57,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 09:16:57" (3/4) ... [2022-02-14 21:16:57,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dcb18aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 09:16:57, skipping insertion in model container [2022-02-14 21:16:57,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.02 09:16:57" (4/4) ... [2022-02-14 21:16:57,636 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.cJordan [2022-02-14 21:16:57,639 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-02-14 21:16:57,640 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-14 21:16:57,664 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-14 21:16:57,668 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:57,669 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-14 21:16:57,675 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:57,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:16:57,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:57,680 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,681 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:57,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:57,684 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-02-14 21:16:57,689 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:57,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120217231] [2022-02-14 21:16:57,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:57,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:57,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:57,781 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,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:57,783 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120217231] [2022-02-14 21:16:57,783 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120217231] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:16:57,784 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:16:57,784 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-14 21:16:57,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696016839] [2022-02-14 21:16:57,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:16:57,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-14 21:16:57,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:57,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-14 21:16:57,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-14 21:16:57,808 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,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:57,830 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-02-14 21:16:57,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-14 21:16:57,848 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,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:57,853 INFO L225 Difference]: With dead ends: 25 [2022-02-14 21:16:57,853 INFO L226 Difference]: Without dead ends: 18 [2022-02-14 21:16:57,855 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,857 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,858 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,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-14 21:16:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-14 21:16:57,885 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,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-02-14 21:16:57,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-02-14 21:16:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:57,887 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-02-14 21:16:57,888 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,888 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-14 21:16:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-14 21:16:57,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:57,889 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,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-14 21:16:57,890 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:57,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-02-14 21:16:57,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:57,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260486073] [2022-02-14 21:16:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:58,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,012 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:58,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:58,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260486073] [2022-02-14 21:16:58,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260486073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:16:58,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:16:58,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-14 21:16:58,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055538252] [2022-02-14 21:16:58,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:16:58,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-14 21:16:58,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:16:58,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-14 21:16:58,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-14 21:16:58,015 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:58,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:16:58,078 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-02-14 21:16:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-14 21:16:58,079 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:58,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:16:58,080 INFO L225 Difference]: With dead ends: 28 [2022-02-14 21:16:58,080 INFO L226 Difference]: Without dead ends: 25 [2022-02-14 21:16:58,080 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-14 21:16:58,083 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:16:58,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-02-14 21:16:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-14 21:16:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-02-14 21:16:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:16:58,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-02-14 21:16:58,092 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 17 [2022-02-14 21:16:58,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:16:58,092 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-02-14 21:16:58,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 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:58,092 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-02-14 21:16:58,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:16:58,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:16:58,093 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,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-14 21:16:58,093 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:16:58,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:16:58,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-02-14 21:16:58,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:16:58,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620065938] [2022-02-14 21:16:58,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:58,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:16:58,115 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,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,146 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:16:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:16:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,238 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,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:16:58,238 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620065938] [2022-02-14 21:16:58,238 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620065938] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:16:58,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134182702] [2022-02-14 21:16:58,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:16:58,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:16:58,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:16:58,249 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:58,253 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:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:16:58,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-14 21:16:58,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:16:58,545 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,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:01,084 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:01,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134182702] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:01,085 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:01,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-02-14 21:17:01,086 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217636915] [2022-02-14 21:17:01,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:01,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-14 21:17:01,087 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-14 21:17:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=68, Unknown=1, NotChecked=0, Total=90 [2022-02-14 21:17:01,089 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:01,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:01,178 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-02-14 21:17:01,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 21:17:01,178 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 21:17:01,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:01,180 INFO L225 Difference]: With dead ends: 31 [2022-02-14 21:17:01,180 INFO L226 Difference]: Without dead ends: 28 [2022-02-14 21:17:01,181 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=45, Invalid=136, Unknown=1, NotChecked=0, Total=182 [2022-02-14 21:17:01,183 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:01,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-02-14 21:17:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-14 21:17:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-14 21:17:01,189 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:17:01,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-02-14 21:17:01,190 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-02-14 21:17:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:01,191 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-02-14 21:17:01,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:01,191 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-02-14 21:17:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-14 21:17:01,193 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:01,193 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:01,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-14 21:17:01,406 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:17:01,407 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:01,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:01,408 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-02-14 21:17:01,408 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:01,408 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895218243] [2022-02-14 21:17:01,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:01,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:01,415 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:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:01,428 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:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:01,507 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:01,507 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:01,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895218243] [2022-02-14 21:17:01,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895218243] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:01,510 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379708593] [2022-02-14 21:17:01,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:01,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:01,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:01,539 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:17:01,571 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:17:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:01,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-14 21:17:01,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:01,709 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:01,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:06,262 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,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379708593] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:06,265 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:06,265 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-02-14 21:17:06,265 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754542706] [2022-02-14 21:17:06,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:06,266 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-14 21:17:06,266 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:06,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-14 21:17:06,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2022-02-14 21:17:06,267 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:17:06,341 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-02-14 21:17:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-14 21:17:06,342 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-14 21:17:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:17:06,343 INFO L225 Difference]: With dead ends: 38 [2022-02-14 21:17:06,343 INFO L226 Difference]: Without dead ends: 35 [2022-02-14 21:17:06,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=45, Invalid=135, Unknown=2, NotChecked=0, Total=182 [2022-02-14 21:17:06,344 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:17:06,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-02-14 21:17:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-14 21:17:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-02-14 21:17:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (3), 3 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,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2022-02-14 21:17:06,353 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 18 [2022-02-14 21:17:06,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:17:06,354 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2022-02-14 21:17:06,358 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2022-02-14 21:17:06,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:17:06,358 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:17:06,359 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:06,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-14 21:17:06,575 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,577 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:17:06,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:17:06,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-02-14 21:17:06,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:17:06,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093080349] [2022-02-14 21:17:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:17:06,587 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:06,593 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:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:06,626 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:06,629 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:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:17:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:06,717 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:06,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:17:06,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093080349] [2022-02-14 21:17:06,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093080349] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:17:06,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309530342] [2022-02-14 21:17:06,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:17:06,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:17:06,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:17:06,732 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,733 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,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:17:06,758 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-14 21:17:06,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:17:06,855 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:06,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:17:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:17:35,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309530342] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:17:35,053 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:17:35,053 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-02-14 21:17:35,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996402542] [2022-02-14 21:17:35,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:17:35,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-14 21:17:35,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:17:35,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-14 21:17:35,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=182, Unknown=11, NotChecked=0, Total=240 [2022-02-14 21:17:35,054 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:17:49,322 WARN L228 SmtUtils]: Spent 8.10s 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:18:00,405 WARN L228 SmtUtils]: Spent 5.00s 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:18:23,244 WARN L228 SmtUtils]: Spent 11.24s on a formula simplification that was a NOOP. DAG size: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:18:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:18:55,625 INFO L93 Difference]: Finished difference Result 60 states and 92 transitions. [2022-02-14 21:18:55,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-14 21:18:55,625 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:18:55,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:18:55,626 INFO L225 Difference]: With dead ends: 60 [2022-02-14 21:18:55,626 INFO L226 Difference]: Without dead ends: 56 [2022-02-14 21:18:55,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 106.5s TimeCoverageRelationStatistics Valid=148, Invalid=572, Unknown=36, NotChecked=0, Total=756 [2022-02-14 21:18:55,627 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 58 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:18:55,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 73 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-02-14 21:18:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-14 21:18:55,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2022-02-14 21:18:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.6875) internal successors, (54), 32 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:18:55,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2022-02-14 21:18:55,631 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 19 [2022-02-14 21:18:55,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:18:55,631 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2022-02-14 21:18:55,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:18:55,631 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2022-02-14 21:18:55,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:18:55,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:18:55,632 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:18:55,652 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:18:55,832 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:18:55,833 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:18:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:18:55,833 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-02-14 21:18:55,833 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:18:55,833 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901841350] [2022-02-14 21:18:55,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:55,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:18:55,839 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:18:55,839 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:18:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:55,863 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:18:55,865 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-02-14 21:18:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:18:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:55,935 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:18:55,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:18:55,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901841350] [2022-02-14 21:18:55,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901841350] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:18:55,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:18:55,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-14 21:18:55,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082456340] [2022-02-14 21:18:55,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:18:55,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:18:55,936 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:18:55,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:18:55,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-14 21:18:55,937 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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:18:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:18:56,030 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-02-14 21:18:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:18:56,030 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 19 [2022-02-14 21:18:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:18:56,031 INFO L225 Difference]: With dead ends: 52 [2022-02-14 21:18:56,031 INFO L226 Difference]: Without dead ends: 46 [2022-02-14 21:18:56,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-14 21:18:56,032 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:18:56,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 41 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 60 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-02-14 21:18:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-14 21:18:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-02-14 21:18:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 3 states have call successors, (3), 3 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:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2022-02-14 21:18:56,035 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 19 [2022-02-14 21:18:56,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:18:56,035 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2022-02-14 21:18:56,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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:18:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2022-02-14 21:18:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:18:56,036 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:18:56,036 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:56,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-14 21:18:56,036 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:18:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:18:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-02-14 21:18:56,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:18:56,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652930557] [2022-02-14 21:18:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:18:56,041 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:18:56,042 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:18:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:56,051 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:18:56,063 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:18:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:18:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:56,148 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:56,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:18:56,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652930557] [2022-02-14 21:18:56,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652930557] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:18:56,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651141340] [2022-02-14 21:18:56,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:18:56,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:18:56,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:18:56,154 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:18:56,154 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:18:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:18:56,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:18:56,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:18:56,418 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:56,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:19:04,248 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_24_31 Int) (v_main_~x~0_25 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_24_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_25 c_main_~x~0)) .cse0) (or (not .cse0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_25) (<= 1 v_it_5))) (not (< c_main_~x~0 v_main_~x~0_25))))) (<= aux_mod_v_main_~x~0_24_31 0) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_24_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_24_31 v_it_6 (* aux_div_v_main_~x~0_24_31 4294967296) 1) v_main_~x~0_25) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< (+ aux_mod_v_main_~x~0_24_31 (* aux_div_v_main_~x~0_24_31 4294967296)) v_main_~x~0_25)))) (not .cse1)) (or .cse1 (forall ((aux_div_v_main_~x~0_24_31 Int)) (not (= v_main_~x~0_25 (+ aux_mod_v_main_~x~0_24_31 (* aux_div_v_main_~x~0_24_31 4294967296)))))))))) is different from false [2022-02-14 21:19:07,410 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:07,411 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651141340] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:07,411 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:07,411 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-02-14 21:19:07,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558276973] [2022-02-14 21:19:07,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:07,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:19:07,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:19:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=4, NotChecked=22, Total=182 [2022-02-14 21:19:07,412 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:14,666 WARN L228 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 77 DAG size of output: 74 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:19:14,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:14,823 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-02-14 21:19:14,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-14 21:19:14,824 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:19:14,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:14,824 INFO L225 Difference]: With dead ends: 52 [2022-02-14 21:19:14,824 INFO L226 Difference]: Without dead ends: 49 [2022-02-14 21:19:14,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=4, NotChecked=36, Total=420 [2022-02-14 21:19:14,825 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:14,825 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 71 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 52 Unchecked, 0.0s Time] [2022-02-14 21:19:14,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-14 21:19:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-02-14 21:19:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (3), 3 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:14,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2022-02-14 21:19:14,828 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 19 [2022-02-14 21:19:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:14,828 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2022-02-14 21:19:14,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2022-02-14 21:19:14,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:19:14,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:14,829 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:14,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-14 21:19:15,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:15,047 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:15,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:15,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-02-14 21:19:15,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:15,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25406832] [2022-02-14 21:19:15,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:15,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:15,052 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:15,053 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:19:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:15,083 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:19:15,088 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:15,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:15,153 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:15,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:15,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25406832] [2022-02-14 21:19:15,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25406832] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:19:15,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:19:15,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-14 21:19:15,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097758591] [2022-02-14 21:19:15,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:19:15,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:19:15,154 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:19:15,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-14 21:19:15,154 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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:19:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:15,228 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-02-14 21:19:15,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:19:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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 19 [2022-02-14 21:19:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:15,229 INFO L225 Difference]: With dead ends: 57 [2022-02-14 21:19:15,229 INFO L226 Difference]: Without dead ends: 52 [2022-02-14 21:19:15,229 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-14 21:19:15,231 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:15,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 41 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-02-14 21:19:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-14 21:19:15,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-02-14 21:19:15,233 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:19:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-02-14 21:19:15,234 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-02-14 21:19:15,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:15,234 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-02-14 21:19:15,234 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 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:19:15,234 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-02-14 21:19:15,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:19:15,234 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:15,234 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:15,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-14 21:19:15,235 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:15,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:15,236 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-02-14 21:19:15,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:15,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427368994] [2022-02-14 21:19:15,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:15,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:15,239 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:15,240 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:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:15,246 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:19:15,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:15,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:15,293 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:15,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:15,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427368994] [2022-02-14 21:19:15,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427368994] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:15,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317653934] [2022-02-14 21:19:15,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:15,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:15,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:15,304 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:19:15,305 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:19:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:15,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:19:15,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:15,472 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:15,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:19:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-14 21:19:39,571 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317653934] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:39,571 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:39,571 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 12 [2022-02-14 21:19:39,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935223308] [2022-02-14 21:19:39,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:39,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-14 21:19:39,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:39,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-14 21:19:39,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=98, Unknown=6, NotChecked=0, Total=132 [2022-02-14 21:19:39,572 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:39,794 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2022-02-14 21:19:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:19:39,794 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:19:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:39,795 INFO L225 Difference]: With dead ends: 57 [2022-02-14 21:19:39,795 INFO L226 Difference]: Without dead ends: 54 [2022-02-14 21:19:39,795 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=55, Invalid=179, Unknown=6, NotChecked=0, Total=240 [2022-02-14 21:19:39,796 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 32 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:39,796 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 64 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 43 Unchecked, 0.0s Time] [2022-02-14 21:19:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-14 21:19:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-02-14 21:19:39,798 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:19:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-02-14 21:19:39,798 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-02-14 21:19:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:39,799 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-02-14 21:19:39,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-02-14 21:19:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:19:39,799 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:39,799 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:39,819 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:19:39,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:40,000 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:40,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:40,000 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-02-14 21:19:40,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:40,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337652915] [2022-02-14 21:19:40,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:40,004 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:40,005 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:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:40,014 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:40,022 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:40,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:40,092 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:40,092 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:40,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337652915] [2022-02-14 21:19:40,092 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337652915] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:40,092 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104922861] [2022-02-14 21:19:40,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:40,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:40,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:40,104 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:19:40,108 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:19:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:40,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-14 21:19:40,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:40,260 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:40,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:19:43,231 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:43,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104922861] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:43,231 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:43,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-02-14 21:19:43,233 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065983378] [2022-02-14 21:19:43,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:43,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:19:43,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:43,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:19:43,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2022-02-14 21:19:43,234 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:43,383 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. [2022-02-14 21:19:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-14 21:19:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:19:43,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:43,384 INFO L225 Difference]: With dead ends: 64 [2022-02-14 21:19:43,384 INFO L226 Difference]: Without dead ends: 61 [2022-02-14 21:19:43,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=101, Invalid=360, Unknown=1, NotChecked=0, Total=462 [2022-02-14 21:19:43,386 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:43,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 68 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 91 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-02-14 21:19:43,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-14 21:19:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2022-02-14 21:19:43,394 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:19:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-02-14 21:19:43,395 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-02-14 21:19:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:43,395 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-02-14 21:19:43,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-02-14 21:19:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-14 21:19:43,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:43,396 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:43,413 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:19:43,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:43,613 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:43,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:43,613 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-02-14 21:19:43,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:43,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152518415] [2022-02-14 21:19:43,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:43,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:43,617 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:43,618 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:19:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:43,625 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:43,627 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:19:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:43,746 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:43,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:43,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152518415] [2022-02-14 21:19:43,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152518415] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:43,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703764503] [2022-02-14 21:19:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:43,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:43,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:43,747 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:19:43,749 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:19:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:43,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-14 21:19:43,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:43,905 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:43,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:19:46,778 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:46,778 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703764503] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:19:46,778 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:19:46,778 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-02-14 21:19:46,778 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371754812] [2022-02-14 21:19:46,778 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:19:46,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-14 21:19:46,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:19:46,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-14 21:19:46,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2022-02-14 21:19:46,779 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:46,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:19:46,949 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-02-14 21:19:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-14 21:19:46,950 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-14 21:19:46,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:19:46,951 INFO L225 Difference]: With dead ends: 62 [2022-02-14 21:19:46,951 INFO L226 Difference]: Without dead ends: 59 [2022-02-14 21:19:46,951 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2022-02-14 21:19:46,951 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 48 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:19:46,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 52 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 67 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-02-14 21:19:46,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-14 21:19:46,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-02-14 21:19:46,954 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:19:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-02-14 21:19:46,954 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-02-14 21:19:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:19:46,954 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-02-14 21:19:46,954 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:19:46,954 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-02-14 21:19:46,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:19:46,955 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:19:46,955 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:19:46,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-14 21:19:47,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:47,174 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:19:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:19:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1145856883, now seen corresponding path program 2 times [2022-02-14 21:19:47,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:19:47,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479644993] [2022-02-14 21:19:47,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:19:47,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:19:47,177 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:19:47,178 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:47,179 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:47,228 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:19:47,230 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:47,232 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:19:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:19:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:19:47,346 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:19:47,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:19:47,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479644993] [2022-02-14 21:19:47,347 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479644993] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:19:47,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [380567567] [2022-02-14 21:19:47,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:19:47,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:19:47,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:19:47,365 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:19:47,385 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:19:47,398 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:19:47,398 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:19:47,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:19:47,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:19:47,497 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:19:47,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:20:21,684 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) is different from false [2022-02-14 21:20:23,704 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) is different from true [2022-02-14 21:20:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-14 21:20:50,611 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [380567567] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:20:50,611 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:20:50,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-02-14 21:20:50,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142048426] [2022-02-14 21:20:50,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:20:50,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-14 21:20:50,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:20:50,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-14 21:20:50,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=181, Unknown=14, NotChecked=28, Total=272 [2022-02-14 21:20:50,612 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:21:05,543 WARN L228 SmtUtils]: Spent 8.75s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:21:07,560 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (or (< 0 (mod c_main_~z~0 4294967296)) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (<= aux_mod_v_main_~x~0_35_31 0) (let ((.cse3 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse3 (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (or (not .cse3) (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (< 0 aux_mod_v_main_~y~0_26_31))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-02-14 21:22:11,612 WARN L228 SmtUtils]: Spent 6.28s 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:22:30,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:22:30,190 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-02-14 21:22:30,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-14 21:22:30,191 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:22:30,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:22:30,191 INFO L225 Difference]: With dead ends: 69 [2022-02-14 21:22:30,191 INFO L226 Difference]: Without dead ends: 66 [2022-02-14 21:22:30,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 130.5s TimeCoverageRelationStatistics Valid=135, Invalid=524, Unknown=51, NotChecked=102, Total=812 [2022-02-14 21:22:30,192 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:22:30,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 76 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2022-02-14 21:22:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-14 21:22:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 46. [2022-02-14 21:22:30,194 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:22:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2022-02-14 21:22:30,194 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 20 [2022-02-14 21:22:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:22:30,194 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2022-02-14 21:22:30,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:22:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2022-02-14 21:22:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:22:30,195 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:22:30,195 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:22:30,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-02-14 21:22:30,403 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,SelfDestructingSolverStorable11 [2022-02-14 21:22:30,404 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:22:30,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:22:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 1 times [2022-02-14 21:22:30,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:22:30,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699173631] [2022-02-14 21:22:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:22:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:22:30,409 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:22:30,410 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:22:30,410 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:22:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:22:30,431 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:22:30,434 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:22:30,436 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:22:30,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:22:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:22:30,523 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:22:30,524 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:22:30,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699173631] [2022-02-14 21:22:30,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699173631] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:22:30,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505546940] [2022-02-14 21:22:30,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:22:30,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:22:30,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:22:30,525 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:22:30,527 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:22:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:22:30,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-14 21:22:30,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:22:30,661 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:22:30,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:22:38,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_38_31 Int)) (or (<= aux_mod_v_main_~x~0_38_31 0) (<= 4294967296 aux_mod_v_main_~x~0_38_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_div_v_main_~x~0_38_31 Int) (aux_div_v_main_~y~0_30_31 Int) (aux_mod_v_main_~y~0_30_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_30_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296) v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~y~0_30_31 c_main_~x~0)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_30_31 (* v_it_6 4294967295)) 4294967296))))) (exists ((v_it_6 Int)) (and (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) v_it_6 aux_mod_v_main_~y~0_30_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse0 aux_mod_v_main_~y~0_30_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296) c_main_~y~0)) (<= aux_mod_v_main_~y~0_30_31 0) (<= c_main_~y~0 (+ .cse0 aux_mod_v_main_~y~0_30_31)) (<= 4294967296 aux_mod_v_main_~y~0_30_31)))) (or (< 0 (mod (+ aux_mod_v_main_~x~0_38_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~x~0_38_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296) v_it_6 1) c_main_~x~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))))) (not .cse1)) (or .cse1 (forall ((aux_div_v_main_~x~0_38_31 Int)) (not (= (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296)) c_main_~x~0)))))))) is different from false [2022-02-14 21:22:39,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-02-14 21:22:39,872 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505546940] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:22:39,872 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:22:39,872 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 13 [2022-02-14 21:22:39,872 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814321338] [2022-02-14 21:22:39,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:22:39,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-14 21:22:39,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:22:39,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-14 21:22:39,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=102, Unknown=3, NotChecked=20, Total=156 [2022-02-14 21:22:39,873 INFO L87 Difference]: Start difference. First operand 46 states and 74 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:22:48,536 WARN L228 SmtUtils]: Spent 8.58s on a formula simplification. DAG size of input: 78 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:22:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:22:48,596 INFO L93 Difference]: Finished difference Result 71 states and 112 transitions. [2022-02-14 21:22:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-14 21:22:48,596 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:22:48,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:22:48,597 INFO L225 Difference]: With dead ends: 71 [2022-02-14 21:22:48,597 INFO L226 Difference]: Without dead ends: 61 [2022-02-14 21:22:48,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=80, Invalid=263, Unknown=3, NotChecked=34, Total=380 [2022-02-14 21:22:48,598 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 42 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:22:48,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 59 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 77 Invalid, 0 Unknown, 46 Unchecked, 0.1s Time] [2022-02-14 21:22:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-14 21:22:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-02-14 21:22:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 47 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:22:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2022-02-14 21:22:48,600 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 20 [2022-02-14 21:22:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:22:48,600 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2022-02-14 21:22:48,600 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:22:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2022-02-14 21:22:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:22:48,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:22:48,601 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:22:48,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-14 21:22:48,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-14 21:22:48,819 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:22:48,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:22:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-02-14 21:22:48,820 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:22:48,820 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842696035] [2022-02-14 21:22:48,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:22:48,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:22:48,823 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:22:48,824 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:22:48,824 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:22:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:22:48,860 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:22:48,862 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:22:48,877 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:22:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:22:49,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:22:49,300 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:22:49,307 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:22:49,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842696035] [2022-02-14 21:22:49,307 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842696035] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:22:49,307 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747621254] [2022-02-14 21:22:49,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:22:49,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:22:49,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:22:49,311 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:22:49,314 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:22:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:22:49,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-14 21:22:49,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:22:49,444 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:22:49,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:23:18,334 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_42_31 Int) (aux_mod_v_main_~y~0_35_31 Int)) (or (< aux_mod_v_main_~y~0_35_31 0) (and (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_35_31 4294967296))) (let ((.cse3 (+ c_main_~y~0 c_main_~z~0)) (.cse2 (+ (* 4294967296 aux_div_v_main_~z~0_40_31) aux_mod_v_main_~y~0_35_31 .cse1))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse1) c_main_~y~0)) (< .cse2 .cse3) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))) (< .cse3 .cse2)))))) (or .cse0 (< (div (+ (- 1) (* (- 1) c_main_~z~0)) (- 4294967296)) (+ 2 (div (+ (- 1) c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (not (= (mod (+ aux_mod_v_main_~x~0_42_31 (* 4294967295 c_main_~x~0)) 4294967296) 0))) (forall ((aux_div_v_main_~x~0_42_31 Int)) (or (let ((.cse4 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse4) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ (* v_it_5 4294967295) (* 4294967295 aux_mod_v_main_~y~0_35_31) c_main_~y~0 c_main_~z~0) 4294967296))))) (forall ((aux_div_v_main_~y~0_35_31 Int) (aux_div_v_main_~z~0_40_31 Int)) (let ((.cse7 (* 4294967296 aux_div_v_main_~z~0_40_31)) (.cse5 (* aux_div_v_main_~y~0_35_31 4294967296)) (.cse6 (+ c_main_~y~0 c_main_~z~0))) (or (not (< (+ aux_mod_v_main_~y~0_35_31 .cse5) c_main_~y~0)) (<= .cse6 (+ .cse7 aux_mod_v_main_~y~0_35_31 .cse5)) (<= (+ .cse7 aux_mod_v_main_~y~0_35_31 4294967296 .cse5) .cse6) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296) 1) c_main_~y~0))))))) (or .cse4 (<= (div (* (- 1) c_main_~z~0) (- 4294967296)) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (forall ((aux_div_v_main_~y~0_35_31 Int)) (not (= (+ aux_mod_v_main_~y~0_35_31 (* aux_div_v_main_~y~0_35_31 4294967296)) c_main_~y~0)))))) (<= (+ aux_mod_v_main_~x~0_42_31 (* aux_div_v_main_~x~0_42_31 4294967296)) c_main_~x~0)))) (<= 4294967296 aux_mod_v_main_~x~0_42_31) (<= aux_mod_v_main_~x~0_42_31 0) (< 0 aux_mod_v_main_~y~0_35_31))) is different from false [2022-02-14 21:23:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-14 21:23:46,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747621254] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:23:46,008 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:23:46,008 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 20 [2022-02-14 21:23:46,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974560061] [2022-02-14 21:23:46,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:23:46,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-14 21:23:46,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:23:46,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-14 21:23:46,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=256, Unknown=18, NotChecked=34, Total=380 [2022-02-14 21:23:46,009 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:24:02,229 WARN L228 SmtUtils]: Spent 10.06s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:24:40,415 WARN L228 SmtUtils]: Spent 11.36s on a formula simplification that was a NOOP. DAG size: 110 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:25:10,759 WARN L228 SmtUtils]: Spent 12.05s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:25:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:25:52,804 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2022-02-14 21:25:52,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-14 21:25:52,804 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:25:52,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:25:52,805 INFO L225 Difference]: With dead ends: 75 [2022-02-14 21:25:52,805 INFO L226 Difference]: Without dead ends: 71 [2022-02-14 21:25:52,805 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 31 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 173.1s TimeCoverageRelationStatistics Valid=158, Invalid=660, Unknown=56, NotChecked=56, Total=930 [2022-02-14 21:25:52,806 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:25:52,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 94 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 120 Invalid, 0 Unknown, 110 Unchecked, 0.1s Time] [2022-02-14 21:25:52,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-14 21:25:52,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-02-14 21:25:52,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 3 states have call successors, (3), 3 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:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-02-14 21:25:52,811 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 20 [2022-02-14 21:25:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:25:52,811 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-02-14 21:25:52,811 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:25:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-02-14 21:25:52,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:25:52,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:25:52,812 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:52,831 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:25:53,014 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,SelfDestructingSolverStorable13 [2022-02-14 21:25:53,014 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:25:53,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:25:53,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-02-14 21:25:53,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:25:53,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282078168] [2022-02-14 21:25:53,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:25:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:25:53,018 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:53,019 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:53,019 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:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:53,036 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:53,037 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:25:53,042 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:53,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:25:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:53,103 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:25:53,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:25:53,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282078168] [2022-02-14 21:25:53,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282078168] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-14 21:25:53,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-14 21:25:53,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-14 21:25:53,103 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480617426] [2022-02-14 21:25:53,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-14 21:25:53,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-14 21:25:53,103 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:25:53,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-14 21:25:53,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-14 21:25:53,104 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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:25:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:25:53,182 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2022-02-14 21:25:53,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-14 21:25:53,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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 20 [2022-02-14 21:25:53,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:25:53,182 INFO L225 Difference]: With dead ends: 62 [2022-02-14 21:25:53,182 INFO L226 Difference]: Without dead ends: 57 [2022-02-14 21:25:53,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-14 21:25:53,183 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:25:53,183 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 58 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-02-14 21:25:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-14 21:25:53,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-02-14 21:25:53,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 3 states have call successors, (3), 3 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:53,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2022-02-14 21:25:53,185 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 20 [2022-02-14 21:25:53,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:25:53,185 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2022-02-14 21:25:53,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 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:25:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2022-02-14 21:25:53,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:25:53,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:25:53,186 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:53,186 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-14 21:25:53,186 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:25:53,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:25:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-02-14 21:25:53,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:25:53,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920997867] [2022-02-14 21:25:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:25:53,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:25:53,189 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:53,190 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:53,190 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:25:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:53,199 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:53,200 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:25:53,201 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-02-14 21:25:53,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:25:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:53,274 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:53,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:25:53,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920997867] [2022-02-14 21:25:53,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920997867] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:25:53,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290670755] [2022-02-14 21:25:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:25:53,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:25:53,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:25:53,280 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:25:53,281 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:25:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:25:53,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-14 21:25:53,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:25:53,451 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:53,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:26:25,641 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse2) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))))) is different from false [2022-02-14 21:26:27,653 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse2) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))))) is different from true [2022-02-14 21:26:33,350 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (not (< 0 (mod c_main_~y~0 4294967296))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-02-14 21:26:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-14 21:26:37,679 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290670755] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:26:37,680 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:26:37,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-02-14 21:26:37,680 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852495541] [2022-02-14 21:26:37,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:26:37,680 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-14 21:26:37,680 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:26:37,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-14 21:26:37,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=158, Unknown=12, NotChecked=54, Total=272 [2022-02-14 21:26:37,681 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:26:54,997 WARN L228 SmtUtils]: Spent 10.19s on a formula simplification that was a NOOP. DAG size: 106 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-14 21:26:57,004 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (or (forall ((aux_div_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (let ((.cse0 (* aux_div_v_main_~x~0_46_31 4294967296))) (or (<= v_main_~x~0_47 .cse0) (not (< 0 (mod c_main_~x~0 4294967296))) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4))) (<= (+ .cse0 4294967296) v_main_~x~0_47)))) (< 0 (mod c_main_~y~0 4294967296))) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse1 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse1) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (let ((.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse2) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse3 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse3 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse3) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0)))))))) is different from false [2022-02-14 21:27:13,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:27:13,795 INFO L93 Difference]: Finished difference Result 69 states and 108 transitions. [2022-02-14 21:27:13,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-14 21:27:13,796 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:27:13,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:27:13,796 INFO L225 Difference]: With dead ends: 69 [2022-02-14 21:27:13,797 INFO L226 Difference]: Without dead ends: 66 [2022-02-14 21:27:13,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 60.8s TimeCoverageRelationStatistics Valid=138, Invalid=503, Unknown=21, NotChecked=150, Total=812 [2022-02-14 21:27:13,797 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:27:13,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 62 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2022-02-14 21:27:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-14 21:27:13,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 49. [2022-02-14 21:27:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 44 states have internal predecessors, (74), 3 states have call successors, (3), 3 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:27:13,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2022-02-14 21:27:13,799 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 20 [2022-02-14 21:27:13,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:27:13,799 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2022-02-14 21:27:13,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:27:13,800 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2022-02-14 21:27:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:27:13,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:27:13,800 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:27:13,820 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:27:14,003 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,SelfDestructingSolverStorable15 [2022-02-14 21:27:14,003 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:27:14,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:27:14,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-02-14 21:27:14,004 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:27:14,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073120566] [2022-02-14 21:27:14,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:27:14,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:27:14,007 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:27:14,008 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:27:14,008 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:27:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:14,015 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:27:14,017 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:27:14,019 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-02-14 21:27:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:27:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:27:14,118 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:27:14,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:27:14,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073120566] [2022-02-14 21:27:14,118 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073120566] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:27:14,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604423940] [2022-02-14 21:27:14,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:27:14,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:27:14,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:27:14,124 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:27:14,125 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:27:14,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:27:14,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:27:14,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:27:14,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:27:14,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:27:14,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:27:19,655 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_51_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_51_31) (<= aux_mod_v_main_~x~0_51_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (or (< 0 (mod (+ aux_mod_v_main_~x~0_51_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~x~0_51_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 (* aux_div_v_main_~x~0_51_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~x~0_51_31 Int) (aux_mod_v_main_~y~0_43_31 Int) (aux_div_v_main_~y~0_43_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_43_31 4294967296))) (or (<= aux_mod_v_main_~y~0_43_31 0) (<= (+ .cse1 aux_mod_v_main_~y~0_43_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_51_31 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_43_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_43_31) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 c_main_~x~0)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_31 (* v_it_6 4294967295)) 4294967296)))))))))) (or .cse0 (forall ((aux_div_v_main_~x~0_51_31 Int)) (not (= (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)))))))) is different from false [2022-02-14 21:27:58,903 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:27:58,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604423940] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:27:58,904 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:27:58,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-02-14 21:27:58,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664351767] [2022-02-14 21:27:58,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:27:58,904 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-14 21:27:58,904 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:27:58,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-14 21:27:58,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=206, Unknown=12, NotChecked=30, Total=306 [2022-02-14 21:27:58,905 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:28:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:28:07,153 INFO L93 Difference]: Finished difference Result 71 states and 108 transitions. [2022-02-14 21:28:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-14 21:28:07,154 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:28:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:28:07,154 INFO L225 Difference]: With dead ends: 71 [2022-02-14 21:28:07,154 INFO L226 Difference]: Without dead ends: 61 [2022-02-14 21:28:07,154 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 34.7s TimeCoverageRelationStatistics Valid=136, Invalid=503, Unknown=15, NotChecked=48, Total=702 [2022-02-14 21:28:07,155 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:28:07,155 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 78 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 94 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-02-14 21:28:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-14 21:28:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-02-14 21:28:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 3 states have call successors, (3), 3 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:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2022-02-14 21:28:07,157 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 20 [2022-02-14 21:28:07,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:28:07,157 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2022-02-14 21:28:07,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:28:07,157 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2022-02-14 21:28:07,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:28:07,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:28:07,157 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:28:07,175 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:28:07,358 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,SelfDestructingSolverStorable16 [2022-02-14 21:28:07,358 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:28:07,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:28:07,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1165808695, now seen corresponding path program 1 times [2022-02-14 21:28:07,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:28:07,359 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008498361] [2022-02-14 21:28:07,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:28:07,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:28:07,361 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:07,362 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:28:07,362 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:28:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:28:07,376 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.8))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:28:07,377 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.9))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:28:07,379 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.10))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:28:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:28:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:28:07,461 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:28:07,461 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:28:07,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008498361] [2022-02-14 21:28:07,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008498361] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:28:07,461 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2108030315] [2022-02-14 21:28:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:28:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:28:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:28:07,462 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:28:07,463 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:28:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:28:07,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-14 21:28:07,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:28:07,660 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:28:07,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:28:39,608 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int)) (or (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_47_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (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_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) c_main_~y~0))) .cse0))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not (= (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_47_31) 4294967296) 0)) .cse2 (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse3) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse3) (not (< c_main_~x~0 v_main_~x~0_58)))))) (or (not .cse2) (forall ((aux_div_v_main_~y~0_47_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (not (< c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_47_31))) (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_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4))) (let ((.cse7 (< 0 (mod c_main_~z~0 4294967296))) (.cse5 (+ c_main_~x~0 c_main_~y~0)) (.cse6 (+ v_main_~x~0_58 .cse4 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse5 .cse6)) .cse7) (or (not .cse7) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< .cse5 .cse6))))))))))) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from false [2022-02-14 21:29:21,505 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int) (aux_mod_main_~y~0_26 Int)) (or (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31) (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26))))) .cse0) (or (not .cse0) (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))))))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_main_~y~0_26 Int) (aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (let ((.cse6 (* 4294967296 aux_div_main_~y~0_26)) (.cse5 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (let ((.cse4 (< 0 (mod c_main_~z~0 4294967296))) (.cse2 (+ aux_mod_main_~y~0_26 .cse6 c_main_~x~0)) (.cse3 (+ v_main_~x~0_58 .cse5 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse2 .cse3)) .cse4) (or (not .cse4) (not (< .cse2 .cse3)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))))))) (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296))))) (not (< (+ aux_mod_main_~y~0_26 .cse6) (+ .cse5 aux_mod_v_main_~y~0_47_31)))))))))) is different from true [2022-02-14 21:29:47,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-14 21:29:47,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2108030315] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:29:47,991 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:29:47,991 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 19 [2022-02-14 21:29:47,991 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045489516] [2022-02-14 21:29:47,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:29:47,991 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-14 21:29:47,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:29:47,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-14 21:29:47,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=204, Unknown=13, NotChecked=62, Total=342 [2022-02-14 21:29:47,992 INFO L87 Difference]: Start difference. First operand 53 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:29:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:29:54,628 INFO L93 Difference]: Finished difference Result 70 states and 108 transitions. [2022-02-14 21:29:54,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-14 21:29:54,628 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:29:54,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:29:54,629 INFO L225 Difference]: With dead ends: 70 [2022-02-14 21:29:54,629 INFO L226 Difference]: Without dead ends: 64 [2022-02-14 21:29:54,630 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=133, Invalid=460, Unknown=15, NotChecked=94, Total=702 [2022-02-14 21:29:54,632 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-14 21:29:54,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 67 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 81 Invalid, 0 Unknown, 112 Unchecked, 0.1s Time] [2022-02-14 21:29:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-14 21:29:54,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-02-14 21:29:54,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.68) internal successors, (84), 50 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:29:54,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 88 transitions. [2022-02-14 21:29:54,635 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 88 transitions. Word has length 20 [2022-02-14 21:29:54,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:29:54,635 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 88 transitions. [2022-02-14 21:29:54,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:29:54,635 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 88 transitions. [2022-02-14 21:29:54,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:29:54,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:29:54,636 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:29:54,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-02-14 21:29:54,849 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,SelfDestructingSolverStorable17 [2022-02-14 21:29:54,851 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:29:54,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:29:54,851 INFO L85 PathProgramCache]: Analyzing trace with hash -392821618, now seen corresponding path program 2 times [2022-02-14 21:29:54,851 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:29:54,851 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098123462] [2022-02-14 21:29:54,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:29:54,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:29:54,854 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:29:54,855 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:29:54,855 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-02-14 21:29:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:29:54,861 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-02-14 21:29:54,862 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.7))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:29:54,864 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-02-14 21:29:54,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:29:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:29:54,945 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:29:54,945 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:29:54,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098123462] [2022-02-14 21:29:54,945 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098123462] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:29:54,945 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802414589] [2022-02-14 21:29:54,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-14 21:29:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:29:54,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:29:54,948 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:29:54,948 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:29:55,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-14 21:29:55,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-14 21:29:55,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-14 21:29:55,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-14 21:29:55,142 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:29:55,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-14 21:29:58,128 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_63_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_63_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_63_31 Int)) (not (= (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) c_main_~x~0))) .cse0) (or (not .cse0) (forall ((v_main_~x~0_64 Int)) (or (not (< c_main_~x~0 v_main_~x~0_64)) (let ((.cse1 (< 0 (mod (+ c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_63_31 Int)) (not (= (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) v_main_~x~0_64))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~x~0_63_31 Int)) (or (not (< v_main_~x~0_64 (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_64 v_it_5 1) (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)))))))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_64)))))))) (<= aux_mod_v_main_~x~0_63_31 0))) is different from false [2022-02-14 21:30:49,586 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:30:49,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802414589] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-14 21:30:49,586 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-14 21:30:49,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 9] total 16 [2022-02-14 21:30:49,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279470104] [2022-02-14 21:30:49,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-14 21:30:49,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-14 21:30:49,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-14 21:30:49,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-14 21:30:49,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=160, Unknown=10, NotChecked=26, Total=240 [2022-02-14 21:30:49,587 INFO L87 Difference]: Start difference. First operand 55 states and 88 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:30:51,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-14 21:30:51,966 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2022-02-14 21:30:51,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-14 21:30:51,966 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-02-14 21:30:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-14 21:30:51,967 INFO L225 Difference]: With dead ends: 75 [2022-02-14 21:30:51,967 INFO L226 Difference]: Without dead ends: 71 [2022-02-14 21:30:51,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 27.3s TimeCoverageRelationStatistics Valid=111, Invalid=388, Unknown=11, NotChecked=42, Total=552 [2022-02-14 21:30:51,967 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-14 21:30:51,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 55 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 64 Invalid, 0 Unknown, 54 Unchecked, 0.0s Time] [2022-02-14 21:30:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-02-14 21:30:51,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 58. [2022-02-14 21:30:51,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 3 states have call successors, (3), 3 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:30:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 93 transitions. [2022-02-14 21:30:51,969 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 93 transitions. Word has length 20 [2022-02-14 21:30:51,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-14 21:30:51,970 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 93 transitions. [2022-02-14 21:30:51,970 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-14 21:30:51,970 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-02-14 21:30:51,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-14 21:30:51,970 INFO L506 BasicCegarLoop]: Found error trace [2022-02-14 21:30:51,970 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:30:51,987 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:30:52,170 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:52,171 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-14 21:30:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-14 21:30:52,171 INFO L85 PathProgramCache]: Analyzing trace with hash -127189554, now seen corresponding path program 1 times [2022-02-14 21:30:52,171 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-14 21:30:52,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732136904] [2022-02-14 21:30:52,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:52,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-14 21:30:52,176 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:30:52,177 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:30:52,178 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:30:52,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:52,186 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-02-14 21:30:52,188 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-02-14 21:30:52,189 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-02-14 21:30:52,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-14 21:30:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-14 21:30:52,264 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:30:52,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-14 21:30:52,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732136904] [2022-02-14 21:30:52,264 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732136904] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-14 21:30:52,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435806623] [2022-02-14 21:30:52,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-14 21:30:52,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-14 21:30:52,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-14 21:30:52,265 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:30:52,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process