/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-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 12:53:03,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:53:03,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:53:03,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:53:03,947 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:53:03,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:53:03,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:53:03,957 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:53:03,959 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:53:03,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:53:03,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:53:03,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:53:03,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:53:03,967 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:53:03,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:53:03,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:53:03,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:53:03,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:53:03,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:53:03,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:53:03,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:53:03,980 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:53:03,983 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:53:03,984 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:53:03,988 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:53:03,988 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:53:03,989 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:53:03,989 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:53:03,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:53:03,990 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:53:03,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:53:03,991 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:53:03,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:53:03,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:53:03,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:53:03,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:53:03,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:53:03,993 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:53:03,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:53:03,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:53:03,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:53:04,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:53:04,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:53:04,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:53:04,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:53:04,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:53:04,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:53:04,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:53:04,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:53:04,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:53:04,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:53:04,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:53:04,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:53:04,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:53:04,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:53:04,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:53:04,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:53:04,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:53:04,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:53:04,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:53:04,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:53:04,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:53:04,021 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:53:04,021 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:53:04,021 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-01-31 12:53:04,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:53:04,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:53:04,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:53:04,256 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:53:04,256 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:53:04,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-01-31 12:53:04,315 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040d423f5/7b8de8325b23453797587aff74680ed1/FLAGef60991a8 [2022-01-31 12:53:04,696 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:53:04,696 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-01-31 12:53:04,705 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040d423f5/7b8de8325b23453797587aff74680ed1/FLAGef60991a8 [2022-01-31 12:53:04,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/040d423f5/7b8de8325b23453797587aff74680ed1 [2022-01-31 12:53:04,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:53:04,726 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:53:04,727 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:53:04,727 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:53:04,730 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:53:04,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70002aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04, skipping insertion in model container [2022-01-31 12:53:04,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:53:04,748 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:53:04,874 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-de52.c[368,381] [2022-01-31 12:53:04,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:53:04,900 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:53:04,909 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-de52.c[368,381] [2022-01-31 12:53:04,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:53:04,934 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:53:04,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04 WrapperNode [2022-01-31 12:53:04,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:53:04,945 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:53:04,945 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:53:04,945 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:53:04,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,959 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,970 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,971 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:53:04,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:53:04,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:53:04,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:53:04,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (1/1) ... [2022-01-31 12:53:04,980 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:53:04,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:04,998 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-01-31 12:53:04,999 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-01-31 12:53:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:53:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:53:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:53:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:53:05,027 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:53:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:53:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 12:53:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:53:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:53:05,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:53:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:53:05,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:53:05,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:53:05,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:53:05,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:53:05,086 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:53:05,088 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:53:05,194 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:53:05,199 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:53:05,199 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 12:53:05,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:05 BoogieIcfgContainer [2022-01-31 12:53:05,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:53:05,201 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:53:05,201 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:53:05,202 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:53:05,205 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:05" (1/1) ... [2022-01-31 12:53:05,400 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-01-31 12:53:05,401 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-01-31 12:53:05,589 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-01-31 12:53:05,590 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (= v_main_~z~0_8 (+ v_main_~z~0_7 1)) (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_8} OutVars{main_~x~0=v_main_~x~0_8, 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 (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_8 v_main_~z~0_7) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (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_9 v_main_~z~0_8 (* (- 1) v_main_~z~0_7)) v_main_~x~0_8) (< 0 .cse0) (< v_main_~z~0_7 v_main_~z~0_8)))) InVars {main_~x~0=v_main_~x~0_9, 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_8, 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-01-31 12:53:05,678 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-01-31 12:53:05,679 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_4 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_3, 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_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, 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_3, 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-01-31 12:53:07,782 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-01-31 12:53:07,783 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 1) v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_7, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~y~0_8) v_main_~y~0_7)) (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~y~0_8 v_main_~y~0_7) (= v_main_~x~0_7 v_main_~x~0_6)))) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-01-31 12:53:07,847 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-01-31 12:53:07,848 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_~y~0_11 (+ v_main_~y~0_10 1))) InVars {main_~z~0=v_main_~z~0_10, main_~y~0=v_main_~y~0_11} OutVars{main_~z~0=v_main_~z~0_9, main_~y~0=v_main_~y~0_10, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~z~0, main_~y~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~y~0_10 (+ v_main_~y~0_11 v_main_~z~0_9 (* (- 1) v_main_~z~0_10))) (< 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)) (and (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)))) InVars {main_~y~0=v_main_~y~0_11, 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_~y~0=v_main_~y~0_10, 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_~z~0, main_~y~0, main_#t~post13, main_#t~post14] [2022-01-31 12:53:07,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:53:07 BasicIcfg [2022-01-31 12:53:07,852 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:53:07,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:53:07,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:53:07,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:53:07,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:53:04" (1/4) ... [2022-01-31 12:53:07,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cf1355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:07, skipping insertion in model container [2022-01-31 12:53:07,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:04" (2/4) ... [2022-01-31 12:53:07,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cf1355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:07, skipping insertion in model container [2022-01-31 12:53:07,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:05" (3/4) ... [2022-01-31 12:53:07,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21cf1355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:53:07, skipping insertion in model container [2022-01-31 12:53:07,858 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:53:07" (4/4) ... [2022-01-31 12:53:07,858 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.cJordan [2022-01-31 12:53:07,863 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:53:07,863 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:53:07,894 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:53:07,900 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-01-31 12:53:07,900 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:53:07,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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-01-31 12:53:07,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 12:53:07,915 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:07,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:07,916 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:07,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash 702671213, now seen corresponding path program 1 times [2022-01-31 12:53:07,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:07,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610767061] [2022-01-31 12:53:07,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:07,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:08,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:08,062 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:08,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610767061] [2022-01-31 12:53:08,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610767061] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:08,064 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:53:08,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:53:08,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410773729] [2022-01-31 12:53:08,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:08,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:53:08,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:08,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:53:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:53:08,100 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 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.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-31 12:53:08,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:08,128 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-01-31 12:53:08,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:53:08,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 16 [2022-01-31 12:53:08,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:08,139 INFO L225 Difference]: With dead ends: 24 [2022-01-31 12:53:08,139 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 12:53:08,140 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-01-31 12:53:08,143 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 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-01-31 12:53:08,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:53:08,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 12:53:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 12:53:08,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 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-01-31 12:53:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-31 12:53:08,170 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-01-31 12:53:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:08,170 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-31 12:53:08,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-01-31 12:53:08,171 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-31 12:53:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 12:53:08,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:08,171 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:08,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:53:08,172 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:08,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:08,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1128942900, now seen corresponding path program 1 times [2022-01-31 12:53:08,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:08,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042543273] [2022-01-31 12:53:08,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:08,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:08,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:08,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:08,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042543273] [2022-01-31 12:53:08,312 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042543273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:08,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:53:08,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 12:53:08,313 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330310049] [2022-01-31 12:53:08,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:08,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 12:53:08,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:08,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 12:53:08,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 12:53:08,319 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-01-31 12:53:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:08,393 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-01-31 12:53:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 12:53:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-01-31 12:53:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:08,396 INFO L225 Difference]: With dead ends: 28 [2022-01-31 12:53:08,396 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 12:53:08,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-01-31 12:53:08,398 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:08,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-01-31 12:53:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 12:53:08,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-01-31 12:53:08,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-01-31 12:53:08,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2022-01-31 12:53:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:08,408 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-01-31 12:53:08,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 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-01-31 12:53:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-01-31 12:53:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:53:08,409 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:08,409 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:08,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:53:08,410 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:08,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash -610770875, now seen corresponding path program 1 times [2022-01-31 12:53:08,410 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:08,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729677075] [2022-01-31 12:53:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:08,411 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:08,430 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-01-31 12:53:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:08,476 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-01-31 12:53:08,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:08,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:08,564 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:08,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729677075] [2022-01-31 12:53:08,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729677075] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:08,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838270157] [2022-01-31 12:53:08,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:08,565 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:08,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:08,571 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-01-31 12:53:08,607 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-01-31 12:53:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:08,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:53:08,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:08,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:11,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:11,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838270157] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:11,879 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:11,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-01-31 12:53:11,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069016596] [2022-01-31 12:53:11,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:11,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:53:11,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:11,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:53:11,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2022-01-31 12:53:11,881 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:12,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:12,073 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-01-31 12:53:12,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:53:12,074 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 12:53:12,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:12,075 INFO L225 Difference]: With dead ends: 36 [2022-01-31 12:53:12,076 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 12:53:12,076 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=102, Invalid=359, Unknown=1, NotChecked=0, Total=462 [2022-01-31 12:53:12,077 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:12,077 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 63 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 18 Unchecked, 0.1s Time] [2022-01-31 12:53:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 12:53:12,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2022-01-31 12:53:12,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 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-01-31 12:53:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-01-31 12:53:12,081 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2022-01-31 12:53:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:12,081 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-01-31 12:53:12,082 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:12,082 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-01-31 12:53:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:53:12,082 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:12,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:12,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:12,283 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-01-31 12:53:12,283 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:12,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:12,284 INFO L85 PathProgramCache]: Analyzing trace with hash 162216202, now seen corresponding path program 1 times [2022-01-31 12:53:12,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:12,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659339407] [2022-01-31 12:53:12,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:12,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:12,292 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-01-31 12:53:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:12,304 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-01-31 12:53:12,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:12,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:12,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659339407] [2022-01-31 12:53:12,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659339407] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:12,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298648091] [2022-01-31 12:53:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:12,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:12,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:12,368 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-01-31 12:53:12,376 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-01-31 12:53:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:12,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:53:12,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:12,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:19,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:19,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298648091] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:19,195 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:19,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-01-31 12:53:19,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824405556] [2022-01-31 12:53:19,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:19,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:53:19,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:19,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:53:19,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=140, Unknown=3, NotChecked=0, Total=182 [2022-01-31 12:53:19,197 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:19,356 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-01-31 12:53:19,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:53:19,356 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 12:53:19,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:19,358 INFO L225 Difference]: With dead ends: 42 [2022-01-31 12:53:19,358 INFO L226 Difference]: Without dead ends: 38 [2022-01-31 12:53:19,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=102, Invalid=357, Unknown=3, NotChecked=0, Total=462 [2022-01-31 12:53:19,359 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:19,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 64 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 72 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-01-31 12:53:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-31 12:53:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2022-01-31 12:53:19,363 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-01-31 12:53:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-01-31 12:53:19,364 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 17 [2022-01-31 12:53:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:19,364 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-01-31 12:53:19,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-01-31 12:53:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:19,365 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:19,365 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:19,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:19,583 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-01-31 12:53:19,584 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:19,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1727307284, now seen corresponding path program 2 times [2022-01-31 12:53:19,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:19,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332048263] [2022-01-31 12:53:19,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:19,585 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:19,591 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-01-31 12:53:19,594 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_11 .cse0 (* (- 4294967296) (div (+ main_~z~0_11 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,620 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:19,622 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_11 .cse0 (* (- 4294967296) (div (+ main_~z~0_11 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:19,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:19,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:19,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332048263] [2022-01-31 12:53:19,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332048263] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:19,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372999254] [2022-01-31 12:53:19,699 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:53:19,699 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:19,700 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-01-31 12:53:19,702 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-01-31 12:53:19,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:53:19,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:53:19,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:53:19,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:19,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:54:03,368 WARN L228 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:54:03,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:54:03,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372999254] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:54:03,381 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:54:03,381 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-01-31 12:54:03,381 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001100240] [2022-01-31 12:54:03,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:54:03,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 12:54:03,382 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:54:03,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 12:54:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=180, Unknown=12, NotChecked=0, Total=240 [2022-01-31 12:54:03,382 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:54:07,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:54:07,647 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2022-01-31 12:54:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 12:54:07,648 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:54:07,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:54:07,648 INFO L225 Difference]: With dead ends: 42 [2022-01-31 12:54:07,648 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 12:54:07,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 38.0s TimeCoverageRelationStatistics Valid=104, Invalid=388, Unknown=14, NotChecked=0, Total=506 [2022-01-31 12:54:07,651 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:54:07,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 55 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 47 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-01-31 12:54:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 12:54:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-01-31 12:54:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 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-01-31 12:54:07,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-01-31 12:54:07,662 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 18 [2022-01-31 12:54:07,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:54:07,662 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-01-31 12:54:07,662 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:54:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-01-31 12:54:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:54:07,663 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:54:07,663 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:54:07,688 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-01-31 12:54:07,887 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-01-31 12:54:07,888 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:54:07,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:54:07,888 INFO L85 PathProgramCache]: Analyzing trace with hash 760455623, now seen corresponding path program 1 times [2022-01-31 12:54:07,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:54:07,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817654414] [2022-01-31 12:54:07,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:54:07,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:54:07,894 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-01-31 12:54:07,899 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-01-31 12:54:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:07,911 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 12:54:07,923 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:54:08,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:54:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:54:08,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:54:08,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817654414] [2022-01-31 12:54:08,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817654414] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:54:08,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347074185] [2022-01-31 12:54:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:54:08,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:54:08,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:54:08,043 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-01-31 12:54:08,044 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-01-31 12:54:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:08,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:54:08,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:54:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:54:08,244 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:54:47,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:54:47,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347074185] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:54:47,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:54:47,363 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-01-31 12:54:47,363 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171760264] [2022-01-31 12:54:47,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:54:47,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 12:54:47,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:54:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 12:54:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=296, Unknown=10, NotChecked=0, Total=380 [2022-01-31 12:54:47,364 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (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-01-31 12:54:53,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:54:53,728 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-01-31 12:54:53,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 12:54:53,728 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (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-01-31 12:54:53,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:54:53,729 INFO L225 Difference]: With dead ends: 41 [2022-01-31 12:54:53,729 INFO L226 Difference]: Without dead ends: 37 [2022-01-31 12:54:53,730 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 40.1s TimeCoverageRelationStatistics Valid=175, Invalid=742, Unknown=13, NotChecked=0, Total=930 [2022-01-31 12:54:53,730 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:54:53,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 74 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 73 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-01-31 12:54:53,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-31 12:54:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-01-31 12:54:53,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 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-01-31 12:54:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-01-31 12:54:53,734 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-01-31 12:54:53,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:54:53,734 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-01-31 12:54:53,734 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (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-01-31 12:54:53,735 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-01-31 12:54:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:54:53,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:54:53,735 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:54:53,758 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-01-31 12:54:53,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:54:53,946 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:54:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:54:53,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1533442700, now seen corresponding path program 2 times [2022-01-31 12:54:53,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:54:53,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503541310] [2022-01-31 12:54:53,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:54:53,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:54:53,952 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 12:54:53,954 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-01-31 12:54:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:53,968 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 12:54:53,977 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-01-31 12:54:54,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:54:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:54:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:54:54,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:54:54,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503541310] [2022-01-31 12:54:54,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503541310] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:54:54,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329578065] [2022-01-31 12:54:54,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:54:54,081 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:54:54,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:54:54,082 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-01-31 12:54:54,082 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-01-31 12:54:54,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:54:54,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:54:54,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:54:54,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:54:54,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:54:54,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:56,037 WARN L228 SmtUtils]: Spent 6.13s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:56:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:03,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329578065] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:56:03,581 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:56:03,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-01-31 12:56:03,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464206450] [2022-01-31 12:56:03,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:56:03,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 12:56:03,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:56:03,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 12:56:03,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=173, Unknown=19, NotChecked=0, Total=240 [2022-01-31 12:56:03,583 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:56:15,980 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-01-31 12:56:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 12:56:15,982 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:56:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:56:15,983 INFO L225 Difference]: With dead ends: 44 [2022-01-31 12:56:15,983 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 12:56:15,984 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 64.7s TimeCoverageRelationStatistics Valid=104, Invalid=377, Unknown=25, NotChecked=0, Total=506 [2022-01-31 12:56:15,984 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:56:15,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 90 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 99 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-01-31 12:56:15,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 12:56:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2022-01-31 12:56:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 3 states have call successors, (3), 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-01-31 12:56:15,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-01-31 12:56:15,988 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 18 [2022-01-31 12:56:15,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:56:15,988 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-01-31 12:56:15,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-01-31 12:56:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:56:15,989 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:56:15,989 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:56:16,005 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-01-31 12:56:16,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:56:16,190 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:56:16,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:56:16,191 INFO L85 PathProgramCache]: Analyzing trace with hash 571694412, now seen corresponding path program 1 times [2022-01-31 12:56:16,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:56:16,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621069964] [2022-01-31 12:56:16,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:16,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:56:16,201 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-01-31 12:56:16,203 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-01-31 12:56:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:16,215 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-01-31 12:56:16,219 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-01-31 12:56:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:56:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:16,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:56:16,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:56:16,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621069964] [2022-01-31 12:56:16,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621069964] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:56:16,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080090775] [2022-01-31 12:56:16,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:16,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:56:16,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:56:16,323 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-01-31 12:56:16,324 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-01-31 12:56:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:16,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 12:56:16,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:56:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:56:16,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:56:18,686 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_32_31 Int)) (or (= aux_mod_v_main_~y~0_32_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_32_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)))) (or (not .cse0) (forall ((aux_div_v_main_~y~0_32_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) c_main_~y~0) (<= 1 v_it_5)))))))) (>= aux_mod_v_main_~y~0_32_31 4294967296) (> 0 aux_mod_v_main_~y~0_32_31))) is different from false [2022-01-31 12:56:22,864 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_32_31 Int)) (or (= aux_mod_v_main_~y~0_32_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (forall ((aux_div_v_main_~y~0_32_31 Int) (aux_mod_v_main_~z~0_25_31 Int) (aux_div_v_main_~z~0_25_31 Int)) (let ((.cse1 (* 4294967296 aux_div_v_main_~z~0_25_31))) (or (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (<= 4294967296 aux_mod_v_main_~z~0_25_31) (<= (+ .cse1 aux_mod_v_main_~z~0_25_31) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (<= (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31 v_it_5 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) (+ c_main_~y~0 c_main_~z~0)) (not (< 0 (mod (+ aux_mod_v_main_~z~0_25_31 (* v_it_5 4294967295)) 4294967296))))) (<= (+ c_main_~y~0 c_main_~z~0) (+ .cse1 aux_mod_v_main_~z~0_25_31 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31)) (<= aux_mod_v_main_~z~0_25_31 0)))) (or (forall ((aux_div_v_main_~y~0_32_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_32_31) c_main_~y~0 c_main_~z~0) 4294967296))))) (or .cse0 (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_32_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) c_main_~y~0) (<= 1 v_it_5)))))))) (>= aux_mod_v_main_~y~0_32_31 4294967296) (> 0 aux_mod_v_main_~y~0_32_31))) is different from false [2022-01-31 12:56:24,872 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_32_31 Int)) (or (= aux_mod_v_main_~y~0_32_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (forall ((aux_div_v_main_~y~0_32_31 Int) (aux_mod_v_main_~z~0_25_31 Int) (aux_div_v_main_~z~0_25_31 Int)) (let ((.cse1 (* 4294967296 aux_div_v_main_~z~0_25_31))) (or (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (<= 4294967296 aux_mod_v_main_~z~0_25_31) (<= (+ .cse1 aux_mod_v_main_~z~0_25_31) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (<= (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31 v_it_5 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) (+ c_main_~y~0 c_main_~z~0)) (not (< 0 (mod (+ aux_mod_v_main_~z~0_25_31 (* v_it_5 4294967295)) 4294967296))))) (<= (+ c_main_~y~0 c_main_~z~0) (+ .cse1 aux_mod_v_main_~z~0_25_31 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31)) (<= aux_mod_v_main_~z~0_25_31 0)))) (or (forall ((aux_div_v_main_~y~0_32_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_32_31) c_main_~y~0 c_main_~z~0) 4294967296))))) (or .cse0 (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_32_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) c_main_~y~0) (<= 1 v_it_5)))))))) (>= aux_mod_v_main_~y~0_32_31 4294967296) (> 0 aux_mod_v_main_~y~0_32_31))) is different from true [2022-01-31 12:56:27,893 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~y~0_32_31 Int)) (or (= aux_mod_v_main_~y~0_32_31 0) (and (forall ((aux_div_v_main_~y~0_32_31 Int) (aux_mod_v_main_~z~0_25_31 Int) (aux_div_v_main_~z~0_25_31 Int)) (let ((.cse0 (* 4294967296 aux_div_v_main_~z~0_25_31))) (or (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (<= 4294967296 aux_mod_v_main_~z~0_25_31) (<= (+ .cse0 aux_mod_v_main_~z~0_25_31) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (<= (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31 v_it_5 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) (+ c_main_~y~0 c_main_~z~0)) (not (< 0 (mod (+ aux_mod_v_main_~z~0_25_31 (* v_it_5 4294967295)) 4294967296))))) (<= (+ c_main_~y~0 c_main_~z~0) (+ .cse0 aux_mod_v_main_~z~0_25_31 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31)) (<= aux_mod_v_main_~z~0_25_31 0)))) (or (forall ((aux_div_v_main_~y~0_32_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_32_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (>= aux_mod_v_main_~y~0_32_31 4294967296) (> 0 aux_mod_v_main_~y~0_32_31))) (not (< 0 (mod c_main_~y~0 4294967296))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-01-31 12:56:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 12:56:27,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080090775] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:56:27,912 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:56:27,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 14 [2022-01-31 12:56:27,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870521342] [2022-01-31 12:56:27,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:56:27,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:56:27,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:56:27,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:56:27,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=85, Unknown=4, NotChecked=60, Total=182 [2022-01-31 12:56:27,924 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:44,191 WARN L228 SmtUtils]: Spent 14.12s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:57:00,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:57:00,225 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-01-31 12:57:00,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 12:57:00,225 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:57:00,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:57:00,226 INFO L225 Difference]: With dead ends: 45 [2022-01-31 12:57:00,226 INFO L226 Difference]: Without dead ends: 41 [2022-01-31 12:57:00,226 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 40.3s TimeCoverageRelationStatistics Valid=84, Invalid=259, Unknown=11, NotChecked=108, Total=462 [2022-01-31 12:57:00,227 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 96 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:57:00,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 62 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 70 Invalid, 0 Unknown, 96 Unchecked, 0.1s Time] [2022-01-31 12:57:00,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-31 12:57:00,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-01-31 12:57:00,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2022-01-31 12:57:00,230 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2022-01-31 12:57:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:57:00,230 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-01-31 12:57:00,231 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2022-01-31 12:57:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:57:00,231 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:57:00,231 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:57:00,247 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-01-31 12:57:00,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:00,435 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:57:00,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:57:00,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1344681489, now seen corresponding path program 1 times [2022-01-31 12:57:00,436 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:57:00,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580223048] [2022-01-31 12:57:00,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:00,436 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:57:00,441 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-01-31 12:57:00,442 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-01-31 12:57:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:00,453 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-01-31 12:57:00,455 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 12:57:00,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:57:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:57:00,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:57:00,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580223048] [2022-01-31 12:57:00,615 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580223048] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:57:00,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775992850] [2022-01-31 12:57:00,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:00,616 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:00,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:57:00,620 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-01-31 12:57:00,623 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-01-31 12:57:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:00,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-31 12:57:00,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:57:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:57:00,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:57:13,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:57:13,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775992850] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:57:13,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:57:13,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-01-31 12:57:13,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377674516] [2022-01-31 12:57:13,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:57:13,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:57:13,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:57:13,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:57:13,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=141, Unknown=2, NotChecked=0, Total=182 [2022-01-31 12:57:13,183 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:13,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:57:13,533 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-01-31 12:57:13,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 12:57:13,533 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:57:13,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:57:13,534 INFO L225 Difference]: With dead ends: 53 [2022-01-31 12:57:13,534 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 12:57:13,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=102, Invalid=358, Unknown=2, NotChecked=0, Total=462 [2022-01-31 12:57:13,535 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:57:13,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 68 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 78 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-01-31 12:57:13,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 12:57:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-01-31 12:57:13,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 states have internal predecessors, (50), 3 states have call successors, (3), 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-01-31 12:57:13,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-01-31 12:57:13,539 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 18 [2022-01-31 12:57:13,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:57:13,539 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2022-01-31 12:57:13,539 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:13,539 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2022-01-31 12:57:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:57:13,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:57:13,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:57:13,557 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-01-31 12:57:13,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:13,747 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:57:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:57:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash -211948756, now seen corresponding path program 1 times [2022-01-31 12:57:13,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:57:13,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538099579] [2022-01-31 12:57:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:13,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:57:13,752 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-01-31 12:57:13,753 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:57:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:13,777 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:57:13,781 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:57:13,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:57:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:57:13,988 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:57:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538099579] [2022-01-31 12:57:13,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538099579] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:57:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896265113] [2022-01-31 12:57:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:13,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:57:13,992 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-01-31 12:57:14,001 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-01-31 12:57:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:14,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 12:57:14,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:57:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:57:14,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:57:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:57:40,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896265113] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:57:40,197 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:57:40,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2022-01-31 12:57:40,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022427190] [2022-01-31 12:57:40,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:57:40,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 12:57:40,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:57:40,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 12:57:40,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=158, Unknown=7, NotChecked=0, Total=210 [2022-01-31 12:57:40,198 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:52,132 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_main_~y~0 4294967296))) (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= .cse0 0) (or (< 0 .cse0) (forall ((aux_mod_v_main_~x~0_23_31 Int) (aux_div_v_main_~y~0_38_31 Int) (aux_mod_v_main_~y~0_38_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) aux_mod_v_main_~x~0_23_31) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_38_31 4294967296) aux_mod_v_main_~y~0_38_31)) (<= 1 v_it_4))) (= aux_mod_v_main_~y~0_38_31 0) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~x~0_23_31 Int)) (not (= (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)) c_main_~x~0)))) (or (forall ((aux_div_v_main_~x~0_23_31 Int)) (or (exists ((v_it_2 Int)) (and (<= (+ v_it_2 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296))) (<= 1 v_it_2) (not (< 0 (mod (+ (* v_it_2 4294967295) c_main_~z~0) 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)))))) (not .cse1)))) (< aux_mod_v_main_~y~0_38_31 0) (<= (+ (* aux_div_v_main_~y~0_38_31 4294967296) aux_mod_v_main_~y~0_38_31) c_main_~y~0) (<= 4294967296 aux_mod_v_main_~x~0_23_31) (<= aux_mod_v_main_~x~0_23_31 0) (<= 4294967296 aux_mod_v_main_~y~0_38_31)))) (= |c_#NULL.offset| |c_old(#NULL.offset)|))) is different from false [2022-01-31 12:57:59,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:57:59,472 INFO L93 Difference]: Finished difference Result 58 states and 86 transitions. [2022-01-31 12:57:59,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 12:57:59,472 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:57:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:57:59,473 INFO L225 Difference]: With dead ends: 58 [2022-01-31 12:57:59,473 INFO L226 Difference]: Without dead ends: 54 [2022-01-31 12:57:59,473 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=117, Invalid=425, Unknown=14, NotChecked=44, Total=600 [2022-01-31 12:57:59,474 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:57:59,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 74 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 67 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-01-31 12:57:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-31 12:57:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2022-01-31 12:57:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 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-01-31 12:57:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2022-01-31 12:57:59,478 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 18 [2022-01-31 12:57:59,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:57:59,478 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2022-01-31 12:57:59,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:59,478 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2022-01-31 12:57:59,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:57:59,479 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:57:59,479 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:57:59,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-31 12:57:59,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 12:57:59,683 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:57:59,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:57:59,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2126008490, now seen corresponding path program 2 times [2022-01-31 12:57:59,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:57:59,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863252119] [2022-01-31 12:57:59,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:59,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:57:59,688 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-01-31 12:57:59,689 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-01-31 12:57:59,690 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-01-31 12:57:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:59,701 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 12:57:59,703 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:57:59,704 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-01-31 12:57:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:57:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:59,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:57:59,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:57:59,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863252119] [2022-01-31 12:57:59,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863252119] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:57:59,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967110278] [2022-01-31 12:57:59,988 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:57:59,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:59,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:57:59,989 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-01-31 12:57:59,990 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-01-31 12:58:00,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:58:00,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:58:00,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:58:00,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:58:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:58:00,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:58:09,985 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_42_31 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_42_31) (<= aux_mod_v_main_~y~0_42_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse0) (and (or (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_42_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_42_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31) c_main_~y~0)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5)))))) (forall ((aux_mod_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_42_31 Int)) (let ((.cse1 (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))) (or (<= 4294967296 aux_mod_v_main_~y~0_43_70) (<= aux_mod_v_main_~y~0_43_70 0) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0 1) (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_70 (* v_it_5 4294967295)) 4294967296))))) (<= .cse1 (+ (* 4294967295 c_main_~y~0) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296) 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (<= 1 v_it_5))) (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse1)))))) (or .cse0 (forall ((aux_div_v_main_~y~0_42_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31) c_main_~y~0)))))))) is different from false [2022-01-31 12:58:43,793 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~y~0_44 Int) (aux_mod_v_main_~y~0_42_31 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_42_31) (<= aux_mod_v_main_~y~0_42_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_44) (<= 1 v_it_4))) (not .cse0) (not (< c_main_~y~0 v_main_~y~0_44))) (or .cse0 (not (= v_main_~y~0_44 c_main_~y~0))))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_42_31 Int)) (not (= v_main_~y~0_44 (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31)))) .cse1) (or (not .cse1) (and (forall ((aux_mod_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_42_31 Int)) (let ((.cse2 (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))) (or (<= 4294967296 aux_mod_v_main_~y~0_43_70) (<= .cse2 (+ (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0)) (<= aux_mod_v_main_~y~0_43_70 0) (<= (+ (* v_main_~y~0_44 4294967296) c_main_~z~0) .cse2) (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 aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296) 1) (+ (* v_main_~y~0_44 4294967296) c_main_~z~0)))) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_70 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0 1) (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))))))) (or (< 0 (mod (+ (* v_main_~y~0_44 4294967295) aux_mod_v_main_~y~0_42_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_42_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31) v_main_~y~0_44)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 1) v_main_~y~0_44) (<= 1 v_it_5)))))))))))) is different from true [2022-01-31 12:59:20,983 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_main_~y~0_44 Int) (aux_mod_main_~y~0_26 Int) (aux_mod_v_main_~y~0_42_31 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_42_31) (< aux_mod_main_~y~0_26 0) (<= aux_mod_v_main_~y~0_42_31 0) (< 0 aux_mod_main_~y~0_26) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_main_~y~0_26 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) v_main_~y~0_44))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) v_main_~y~0_44))))) (or .cse0 (forall ((aux_div_main_~y~0_26 Int)) (not (= v_main_~y~0_44 (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)))))))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_42_31 Int)) (not (= v_main_~y~0_44 (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31)))) .cse1) (or (not .cse1) (and (forall ((aux_mod_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_42_31 Int)) (let ((.cse2 (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))) (or (<= 4294967296 aux_mod_v_main_~y~0_43_70) (<= .cse2 (+ (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0)) (<= aux_mod_v_main_~y~0_43_70 0) (<= (+ (* v_main_~y~0_44 4294967296) c_main_~z~0) .cse2) (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 aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296) 1) (+ (* v_main_~y~0_44 4294967296) c_main_~z~0)))) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_70 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0 1) (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))))))) (or (< 0 (mod (+ (* v_main_~y~0_44 4294967295) aux_mod_v_main_~y~0_42_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_42_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31) v_main_~y~0_44)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 1) v_main_~y~0_44) (<= 1 v_it_5)))))))))))) is different from false [2022-01-31 12:59:23,009 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~y~0_44 Int) (aux_mod_main_~y~0_26 Int) (aux_mod_v_main_~y~0_42_31 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_42_31) (< aux_mod_main_~y~0_26 0) (<= aux_mod_v_main_~y~0_42_31 0) (< 0 aux_mod_main_~y~0_26) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_main_~y~0_26 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) v_main_~y~0_44))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) v_main_~y~0_44))))) (or .cse0 (forall ((aux_div_main_~y~0_26 Int)) (not (= v_main_~y~0_44 (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)))))))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_42_31 Int)) (not (= v_main_~y~0_44 (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31)))) .cse1) (or (not .cse1) (and (forall ((aux_mod_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_42_31 Int)) (let ((.cse2 (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))) (or (<= 4294967296 aux_mod_v_main_~y~0_43_70) (<= .cse2 (+ (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0)) (<= aux_mod_v_main_~y~0_43_70 0) (<= (+ (* v_main_~y~0_44 4294967296) c_main_~z~0) .cse2) (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 aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296) 1) (+ (* v_main_~y~0_44 4294967296) c_main_~z~0)))) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_70 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0 1) (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))))))) (or (< 0 (mod (+ (* v_main_~y~0_44 4294967295) aux_mod_v_main_~y~0_42_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_42_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31) v_main_~y~0_44)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 1) v_main_~y~0_44) (<= 1 v_it_5)))))))))))) is different from true [2022-01-31 12:59:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 12:59:23,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967110278] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:59:23,915 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:59:23,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2022-01-31 12:59:23,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671306464] [2022-01-31 12:59:23,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:59:23,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 12:59:23,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:59:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 12:59:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=243, Unknown=4, NotChecked=102, Total=420 [2022-01-31 12:59:23,916 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:59:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:59:27,321 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-01-31 12:59:27,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 12:59:27,322 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:59:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:59:27,322 INFO L225 Difference]: With dead ends: 57 [2022-01-31 12:59:27,322 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 12:59:27,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=180, Invalid=698, Unknown=4, NotChecked=174, Total=1056 [2022-01-31 12:59:27,323 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 12:59:27,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 90 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 114 Invalid, 0 Unknown, 89 Unchecked, 0.3s Time] [2022-01-31 12:59:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 12:59:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-01-31 12:59:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:59:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-01-31 12:59:27,327 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 19 [2022-01-31 12:59:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:59:27,327 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-01-31 12:59:27,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:59:27,328 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-01-31 12:59:27,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:59:27,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:59:27,328 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:59:27,352 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-01-31 12:59:27,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:59:27,529 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:59:27,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:59:27,529 INFO L85 PathProgramCache]: Analyzing trace with hash 318804101, now seen corresponding path program 3 times [2022-01-31 12:59:27,529 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:59:27,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419156921] [2022-01-31 12:59:27,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:59:27,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:59:27,535 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-01-31 12:59:27,536 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-01-31 12:59:27,536 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:59:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:59:27,572 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 12:59:27,575 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-01-31 12:59:27,577 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-01-31 12:59:27,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:59:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:59:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:59:27,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:59:27,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419156921] [2022-01-31 12:59:27,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419156921] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:59:27,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093693937] [2022-01-31 12:59:27,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-31 12:59:27,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:59:27,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:59:27,880 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-01-31 12:59:27,880 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-01-31 12:59:27,911 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-31 12:59:27,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:59:27,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:59:27,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:59:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:59:28,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:59:42,806 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_48_31 Int) (v_main_~y~0_49 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_48_31) (<= aux_mod_v_main_~y~0_48_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_48_31 Int)) (or (not (< (+ aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296)) v_main_~y~0_49)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296) 1) v_main_~y~0_49) (<= 1 v_it_5)))))) (or (forall ((aux_div_v_main_~y~0_48_31 Int)) (not (= v_main_~y~0_49 (+ aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296))))) .cse0))) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse1) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_49))) (not (< c_main_~y~0 v_main_~y~0_49))) (or .cse1 (not (= v_main_~y~0_49 c_main_~y~0))))))) is different from false [2022-01-31 13:02:15,990 WARN L860 $PredicateComparison]: unable to prove that (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_48_31 Int) (v_main_~y~0_49 Int)) (let ((.cse6 (* aux_div_v_main_~y~0_48_31 4294967296))) (or (and (forall ((aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_main_~y~0_26_81 Int) (aux_div_aux_mod_main_~y~0_26_81 Int)) (let ((.cse0 (* aux_div_aux_mod_main_~y~0_26_81 4294967296))) (let ((.cse2 (+ .cse0 aux_mod_aux_mod_main_~y~0_26_81)) (.cse1 (+ (* v_main_~y~0_49 4294967295) c_main_~x~0))) (or (< 0 aux_mod_aux_mod_main_~y~0_26_81) (<= (+ (* v_main_~y~0_49 4294967296) c_main_~x~0) (+ .cse0 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_main_~y~0_26_81 4294967296) v_it_4 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* v_main_~y~0_49 4294967296) c_main_~x~0)) (<= 1 v_it_4))) (< .cse1 .cse2) (< aux_mod_aux_mod_main_~y~0_26_81 0) (< .cse2 .cse1))))) (forall ((v_main_~y~0_50 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_main_~y~0_26_81 Int) (aux_div_aux_mod_main_~y~0_26_81 Int)) (let ((.cse3 (* aux_div_aux_mod_main_~y~0_26_81 4294967296))) (let ((.cse5 (+ (* v_main_~y~0_50 4294967295) c_main_~x~0)) (.cse4 (+ .cse3 aux_mod_aux_mod_main_~y~0_26_81))) (or (<= (+ (* v_main_~y~0_50 4294967296) c_main_~x~0) (+ .cse3 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26))) (<= v_main_~y~0_49 v_main_~y~0_50) (< .cse4 .cse5) (<= 4294967296 aux_mod_aux_mod_main_~y~0_26_81) (< .cse5 .cse4) (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_50 v_it_4 1) v_main_~y~0_49) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) aux_mod_aux_mod_main_~y~0_26_81) 4294967296))))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_main_~y~0_26_81 4294967296) v_it_4 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* v_main_~y~0_50 4294967296) c_main_~x~0)) (<= 1 v_it_4))) (<= aux_mod_aux_mod_main_~y~0_26_81 0)))))) (<= v_main_~y~0_49 .cse6) (<= (+ 4294967296 .cse6) v_main_~y~0_49))))) is different from true [2022-01-31 13:02:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 13:02:16,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093693937] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:02:16,000 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:02:16,000 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2022-01-31 13:02:16,000 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427807134] [2022-01-31 13:02:16,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:02:16,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 13:02:16,001 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:02:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 13:02:16,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=306, Unknown=37, NotChecked=78, Total=506 [2022-01-31 13:02:16,002 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 20 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:02:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:02:39,756 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2022-01-31 13:02:39,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 13:02:39,757 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 20 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 13:02:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:02:39,757 INFO L225 Difference]: With dead ends: 56 [2022-01-31 13:02:39,757 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 13:02:39,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 113.8s TimeCoverageRelationStatistics Valid=202, Invalid=815, Unknown=47, NotChecked=126, Total=1190 [2022-01-31 13:02:39,759 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 36 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 13:02:39,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 100 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 106 Invalid, 0 Unknown, 110 Unchecked, 0.3s Time] [2022-01-31 13:02:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 13:02:39,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-01-31 13:02:39,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:02:39,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-01-31 13:02:39,762 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 19 [2022-01-31 13:02:39,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:02:39,762 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-01-31 13:02:39,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 20 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:02:39,762 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-01-31 13:02:39,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 13:02:39,763 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:02:39,763 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:02:39,813 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-01-31 13:02:39,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 13:02:39,992 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:02:39,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:02:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash 569378245, now seen corresponding path program 2 times [2022-01-31 13:02:39,995 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:02:39,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820393421] [2022-01-31 13:02:39,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:02:39,995 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:02:39,999 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-01-31 13:02:40,000 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-01-31 13:02:40,001 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-01-31 13:02:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:02:40,011 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 13:02:40,014 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-01-31 13:02:40,016 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-01-31 13:02:40,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:02:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:02:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:02:40,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:02:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820393421] [2022-01-31 13:02:40,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820393421] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:02:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435954157] [2022-01-31 13:02:40,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 13:02:40,287 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:02:40,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:02:40,288 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-01-31 13:02:40,289 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-01-31 13:02:40,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 13:02:40,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:02:40,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 13:02:40,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:02:40,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:02:40,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:02:54,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_54_31 Int)) (not (= (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (or (not .cse0) (and (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse1 (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70))) (or (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse1) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70)) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= .cse1 (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296))) (<= aux_mod_v_main_~y~0_55_70 0) (<= 4294967296 aux_mod_v_main_~y~0_55_70)))) (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0) 4294967296))))))) (>= aux_mod_v_main_~y~0_54_31 4294967296))) is different from false [2022-01-31 13:03:52,924 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (>= aux_mod_v_main_~y~0_54_31 4294967296) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (or (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_54_31) c_main_~y~0 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (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_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0))))) (forall ((aux_mod_v_main_~z~0_45_31 Int) (aux_div_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_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 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0) (and (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~z~0_45_31 v_it_5 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ c_main_~y~0 c_main_~z~0)) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~z~0_45_31 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296)) (+ c_main_~y~0 c_main_~z~0))))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_mod_v_main_~z~0_45_31 2) (* 4294967295 c_main_~z~0)) 4294967296))) (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_55_70 4294967296))) (or (<= aux_mod_v_main_~y~0_55_70 0) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1 (* 4294967295 c_main_~z~0)) (+ (* aux_div_v_main_~y~0_55_70 4294967296) (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0))))) (<= (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0)) (+ .cse0 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70)) (<= 4294967296 aux_mod_v_main_~y~0_55_70) (<= (+ .cse0 (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294)) (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) (* 4294967295 c_main_~z~0)))))))))) (not .cse1)) (or .cse1 (not (< 0 (mod c_main_~z~0 4294967296))) (and (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse2 (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70))) (or (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse2) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70)) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= .cse2 (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296))) (<= aux_mod_v_main_~y~0_55_70 0) (<= 4294967296 aux_mod_v_main_~y~0_55_70)))) (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0) 4294967296))))))))) is different from true [2022-01-31 13:04:27,836 WARN L860 $PredicateComparison]: unable to prove that (or (not (< 0 (mod c_main_~y~0 4294967296))) (< 0 (mod c_main_~z~0 4294967296)) (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (and (or (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_54_31) c_main_~y~0 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (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_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0))))) (forall ((aux_mod_v_main_~z~0_45_31 Int) (aux_div_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_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 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0) (and (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~z~0_45_31 v_it_5 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ c_main_~y~0 c_main_~z~0)) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~z~0_45_31 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296)) (+ c_main_~y~0 c_main_~z~0))))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_mod_v_main_~z~0_45_31 2) (* 4294967295 c_main_~z~0)) 4294967296))) (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_55_70 4294967296))) (or (<= aux_mod_v_main_~y~0_55_70 0) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1 (* 4294967295 c_main_~z~0)) (+ (* aux_div_v_main_~y~0_55_70 4294967296) (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0))))) (<= (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0)) (+ .cse0 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70)) (<= 4294967296 aux_mod_v_main_~y~0_55_70) (<= (+ .cse0 (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294)) (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) (* 4294967295 c_main_~z~0)))))))))) (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (>= aux_mod_v_main_~y~0_54_31 4294967296)))) is different from true [2022-01-31 13:04:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 13:04:27,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435954157] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:04:27,860 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:04:27,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9] total 15 [2022-01-31 13:04:27,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869553776] [2022-01-31 13:04:27,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:04:27,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 13:04:27,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:04:27,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 13:04:27,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=101, Unknown=7, NotChecked=66, Total=210 [2022-01-31 13:04:27,862 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:04:42,632 WARN L228 SmtUtils]: Spent 12.46s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:04:44,665 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (>= aux_mod_v_main_~y~0_54_31 4294967296) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (or (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_54_31) c_main_~y~0 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (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_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0))))) (forall ((aux_mod_v_main_~z~0_45_31 Int) (aux_div_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_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 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0) (and (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~z~0_45_31 v_it_5 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ c_main_~y~0 c_main_~z~0)) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~z~0_45_31 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296)) (+ c_main_~y~0 c_main_~z~0))))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_mod_v_main_~z~0_45_31 2) (* 4294967295 c_main_~z~0)) 4294967296))) (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_55_70 4294967296))) (or (<= aux_mod_v_main_~y~0_55_70 0) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1 (* 4294967295 c_main_~z~0)) (+ (* aux_div_v_main_~y~0_55_70 4294967296) (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0))))) (<= (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0)) (+ .cse0 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70)) (<= 4294967296 aux_mod_v_main_~y~0_55_70) (<= (+ .cse0 (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294)) (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) (* 4294967295 c_main_~z~0)))))))))) (not .cse1)) (or .cse1 (not (< 0 (mod c_main_~z~0 4294967296))) (and (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse2 (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70))) (or (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse2) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70)) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= .cse2 (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296))) (<= aux_mod_v_main_~y~0_55_70 0) (<= 4294967296 aux_mod_v_main_~y~0_55_70)))) (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0) 4294967296))))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 13:04:47,033 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_54_31 Int)) (not (= (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (or (not .cse0) (and (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse1 (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70))) (or (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse1) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70)) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= .cse1 (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296))) (<= aux_mod_v_main_~y~0_55_70 0) (<= 4294967296 aux_mod_v_main_~y~0_55_70)))) (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0) 4294967296))))))) (>= aux_mod_v_main_~y~0_54_31 4294967296))) (= (mod c_main_~y~0 4294967296) 0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 13:05:13,969 WARN L228 SmtUtils]: Spent 7.28s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:05:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:05:18,156 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2022-01-31 13:05:18,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 13:05:18,157 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 13:05:18,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:05:18,157 INFO L225 Difference]: With dead ends: 56 [2022-01-31 13:05:18,157 INFO L226 Difference]: Without dead ends: 49 [2022-01-31 13:05:18,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 66.4s TimeCoverageRelationStatistics Valid=84, Invalid=257, Unknown=21, NotChecked=190, Total=552 [2022-01-31 13:05:18,158 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 13:05:18,158 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 58 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 103 Unchecked, 0.1s Time] [2022-01-31 13:05:18,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-31 13:05:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-01-31 13:05:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 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-01-31 13:05:18,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2022-01-31 13:05:18,161 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 19 [2022-01-31 13:05:18,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:05:18,161 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2022-01-31 13:05:18,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:05:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2022-01-31 13:05:18,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 13:05:18,162 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:05:18,162 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-01-31 13:05:18,182 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-01-31 13:05:18,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 13:05:18,375 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:05:18,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:05:18,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1237826144, now seen corresponding path program 1 times [2022-01-31 13:05:18,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:05:18,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630081830] [2022-01-31 13:05:18,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:05:18,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:05:18,380 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-01-31 13:05:18,381 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-01-31 13:05:18,382 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-01-31 13:05:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:05:18,408 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-01-31 13:05:18,411 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 13:05:18,412 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-01-31 13:05:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:05:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:05:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 13:05:18,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:05:18,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630081830] [2022-01-31 13:05:18,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630081830] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:05:18,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811500202] [2022-01-31 13:05:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:05:18,765 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:05:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:05:18,768 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-01-31 13:05:18,771 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-01-31 13:05:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:05:18,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 13:05:18,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:05:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 13:05:19,150 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:05:21,578 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) c_main_~y~0)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5)))))) (or .cse0 (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) c_main_~y~0)))))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31))) is different from false [2022-01-31 13:05:27,690 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_main_~y~0_61 Int) (aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))) .cse0) (or (not .cse0) (forall ((aux_div_v_main_~y~0_60_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 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61))) (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) v_main_~y~0_61))))))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse1 (not (= v_main_~y~0_61 c_main_~y~0))) (or (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_61) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< c_main_~y~0 v_main_~y~0_61)) (not .cse1)))) (> 0 aux_mod_v_main_~y~0_60_31))) is different from true [2022-01-31 13:06:13,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((v_main_~y~0_61 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~y~0_60_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 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61))) (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) v_main_~y~0_61))))))) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse2 (not (= v_main_~y~0_61 c_main_~y~0))) (or (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_61) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< c_main_~y~0 v_main_~y~0_61)) (not .cse2))))))) (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse6 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse5 (< 0 (mod c_main_~x~0 4294967296))) (.cse4 (+ c_main_~y~0 c_main_~z~0)) (.cse3 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse6))) (and (or (not (= .cse3 .cse4)) .cse5) (or (not .cse5) (not (< .cse4 .cse3)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse6) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse7 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse7) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_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 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse7)))))) (not .cse0)))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31))) is different from false [2022-01-31 13:06:37,479 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31) (let ((.cse5 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse3 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296))) (.cse1 (+ c_main_~y~0 c_main_~z~0)) (.cse0 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse3))) (and (or (not (= .cse0 .cse1)) .cse2) (or (not .cse2) (not (< .cse1 .cse0)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse3) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse4 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse4) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_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 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse4)))))) (not .cse5)) (or .cse5 (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))))))))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-01-31 13:06:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-31 13:06:37,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811500202] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:06:37,816 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:06:37,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 18 [2022-01-31 13:06:37,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944627272] [2022-01-31 13:06:37,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:06:37,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 13:06:37,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:06:37,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 13:06:37,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=143, Unknown=4, NotChecked=108, Total=306 [2022-01-31 13:06:37,817 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:06:40,063 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (= c_main_~y~0 0) (= c_main_~z~0 0) (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((v_main_~y~0_61 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~y~0_60_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 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61))) (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) v_main_~y~0_61))))))) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse2 (not (= v_main_~y~0_61 c_main_~y~0))) (or (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_61) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< c_main_~y~0 v_main_~y~0_61)) (not .cse2))))))) (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse6 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse5 (< 0 (mod c_main_~x~0 4294967296))) (.cse4 (+ c_main_~y~0 c_main_~z~0)) (.cse3 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse6))) (and (or (not (= .cse3 .cse4)) .cse5) (or (not .cse5) (not (< .cse4 .cse3)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse6) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse7 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse7) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_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 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse7)))))) (not .cse0)))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 13:06:52,500 WARN L228 SmtUtils]: Spent 10.37s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:06:54,543 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (or (< 0 (mod c_main_~y~0 4294967296)) (<= (mod c_main_~x~0 4294967296) 0)) (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((v_main_~y~0_61 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~y~0_60_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 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61))) (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) v_main_~y~0_61))))))) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse2 (not (= v_main_~y~0_61 c_main_~y~0))) (or (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_61) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< c_main_~y~0 v_main_~y~0_61)) (not .cse2))))))) (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse6 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse5 (< 0 (mod c_main_~x~0 4294967296))) (.cse4 (+ c_main_~y~0 c_main_~z~0)) (.cse3 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse6))) (and (or (not (= .cse3 .cse4)) .cse5) (or (not .cse5) (not (< .cse4 .cse3)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse6) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse7 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse7) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_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 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse7)))))) (not .cse0)))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 13:07:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 13:07:07,163 INFO L93 Difference]: Finished difference Result 60 states and 85 transitions. [2022-01-31 13:07:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 13:07:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 13:07:07,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 13:07:07,164 INFO L225 Difference]: With dead ends: 60 [2022-01-31 13:07:07,164 INFO L226 Difference]: Without dead ends: 56 [2022-01-31 13:07:07,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 28 SyntacticMatches, 10 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=131, Invalid=434, Unknown=11, NotChecked=294, Total=870 [2022-01-31 13:07:07,165 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 13:07:07,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 70 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 64 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2022-01-31 13:07:07,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-01-31 13:07:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2022-01-31 13:07:07,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:07:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2022-01-31 13:07:07,168 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 19 [2022-01-31 13:07:07,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 13:07:07,168 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2022-01-31 13:07:07,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:07:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2022-01-31 13:07:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 13:07:07,169 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 13:07:07,169 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 13:07:07,188 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-01-31 13:07:07,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 13:07:07,375 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 13:07:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 13:07:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash -464839067, now seen corresponding path program 2 times [2022-01-31 13:07:07,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 13:07:07,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663439406] [2022-01-31 13:07:07,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 13:07:07,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 13:07:07,380 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-01-31 13:07:07,381 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-01-31 13:07:07,381 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-01-31 13:07:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:07:07,389 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-01-31 13:07:07,396 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-01-31 13:07:07,404 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-01-31 13:07:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 13:07:07,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 13:07:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:07:07,665 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 13:07:07,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663439406] [2022-01-31 13:07:07,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663439406] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 13:07:07,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29008676] [2022-01-31 13:07:07,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 13:07:07,666 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:07:07,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 13:07:07,668 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-01-31 13:07:07,670 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-01-31 13:07:07,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 13:07:07,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 13:07:07,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 13:07:07,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 13:07:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 13:07:08,022 INFO L328 TraceCheckSpWp]: Computing backward predicates...