/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-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 12:50:39,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:50:39,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:50:39,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:50:39,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:50:39,222 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:50:39,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:50:39,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:50:39,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:50:39,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:50:39,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:50:39,235 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:50:39,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:50:39,236 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:50:39,237 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:50:39,238 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:50:39,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:50:39,239 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:50:39,240 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:50:39,242 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:50:39,243 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:50:39,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:50:39,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:50:39,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:50:39,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:50:39,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:50:39,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:50:39,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:50:39,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:50:39,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:50:39,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:50:39,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:50:39,261 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:50:39,261 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:50:39,262 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:50:39,262 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:50:39,263 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:50:39,263 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:50:39,263 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:50:39,264 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:50:39,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:50:39,265 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:50:39,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:50:39,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:50:39,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:50:39,277 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:50:39,278 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:50:39,279 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:50:39,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:50:39,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:50:39,279 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:50:39,279 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:50:39,279 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:50:39,279 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:50:39,279 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:50:39,280 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:50:39,280 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:50:39,280 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:50:39,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:50:39,489 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:50:39,491 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:50:39,492 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:50:39,493 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:50:39,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-01-31 12:50:39,543 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61276abc3/2680f5257b46477aa46bab28edeffbe4/FLAGbe01cc79a [2022-01-31 12:50:39,937 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:50:39,937 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-01-31 12:50:39,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61276abc3/2680f5257b46477aa46bab28edeffbe4/FLAGbe01cc79a [2022-01-31 12:50:39,962 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61276abc3/2680f5257b46477aa46bab28edeffbe4 [2022-01-31 12:50:39,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:50:39,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:50:39,970 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:50:39,970 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:50:39,973 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:50:39,974 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:50:39" (1/1) ... [2022-01-31 12:50:39,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@640a9784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:39, skipping insertion in model container [2022-01-31 12:50:39,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:50:39" (1/1) ... [2022-01-31 12:50:39,980 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:50:39,992 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:50:40,155 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-de51.c[368,381] [2022-01-31 12:50:40,170 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:50:40,181 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:50:40,196 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-de51.c[368,381] [2022-01-31 12:50:40,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:50:40,218 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:50:40,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40 WrapperNode [2022-01-31 12:50:40,219 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:50:40,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:50:40,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:50:40,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:50:40,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,279 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,280 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:50:40,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:50:40,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:50:40,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:50:40,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:50:40,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:50:40,311 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:50:40,320 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:50:40,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:50:40,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:50:40,339 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:50:40,339 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:50:40,340 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:50:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:50:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:50:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:50:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:50:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 12:50:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:50:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:50:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:50:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:50:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:50:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:50:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:50:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:50:40,393 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:50:40,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:50:40,495 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:50:40,499 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:50:40,499 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-31 12:50:40,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:50:40 BoogieIcfgContainer [2022-01-31 12:50:40,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:50:40,501 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:50:40,501 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:50:40,502 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:50:40,505 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:50:40" (1/1) ... [2022-01-31 12:50:40,714 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:50:40,715 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:50:40,888 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:50:40,889 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:50:40,964 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:50:40,965 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:50:43,098 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:50:43,099 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:50:43,189 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:50:43,190 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~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_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~x~0_11 v_main_~x~0_10) (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)) (and (= v_main_~x~0_10 (+ v_main_~x~0_11 v_main_~z~0_10 (* (- 1) v_main_~z~0_9))) (< 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)))) InVars {main_~x~0=v_main_~x~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_~x~0=v_main_~x~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_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-01-31 12:50:43,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:50:43 BasicIcfg [2022-01-31 12:50:43,194 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:50:43,196 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:50:43,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:50:43,198 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:50:43,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:50:39" (1/4) ... [2022-01-31 12:50:43,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c44bd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:50:43, skipping insertion in model container [2022-01-31 12:50:43,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:50:40" (2/4) ... [2022-01-31 12:50:43,199 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c44bd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:50:43, skipping insertion in model container [2022-01-31 12:50:43,199 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:50:40" (3/4) ... [2022-01-31 12:50:43,200 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c44bd96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:50:43, skipping insertion in model container [2022-01-31 12:50:43,200 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:50:43" (4/4) ... [2022-01-31 12:50:43,201 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.cJordan [2022-01-31 12:50:43,205 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:50:43,205 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:50:43,236 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:50:43,242 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:50:43,242 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:50:43,252 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:50:43,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 12:50:43,257 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:50:43,257 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:50:43,258 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:50:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:50:43,262 INFO L85 PathProgramCache]: Analyzing trace with hash 702671213, now seen corresponding path program 1 times [2022-01-31 12:50:43,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:50:43,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025142331] [2022-01-31 12:50:43,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:43,270 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:50:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:43,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:50:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:43,406 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:50:43,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:50:43,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025142331] [2022-01-31 12:50:43,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025142331] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:50:43,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:50:43,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:50:43,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822001165] [2022-01-31 12:50:43,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:50:43,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:50:43,413 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:50:43,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:50:43,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:50:43,441 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:50:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:50:43,466 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-01-31 12:50:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:50:43,469 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:50:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:50:43,477 INFO L225 Difference]: With dead ends: 24 [2022-01-31 12:50:43,477 INFO L226 Difference]: Without dead ends: 17 [2022-01-31 12:50:43,478 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:50:43,481 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:50:43,482 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:50:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-31 12:50:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-01-31 12:50:43,504 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:50:43,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-01-31 12:50:43,506 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-01-31 12:50:43,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:50:43,506 INFO L470 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-01-31 12:50:43,506 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:50:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-01-31 12:50:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 12:50:43,507 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:50:43,507 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:50:43,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:50:43,508 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:50:43,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:50:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1128942900, now seen corresponding path program 1 times [2022-01-31 12:50:43,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:50:43,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166380560] [2022-01-31 12:50:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:43,512 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:50:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:43,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:50:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:43,708 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:50:43,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:50:43,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166380560] [2022-01-31 12:50:43,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166380560] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:50:43,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:50:43,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 12:50:43,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850320750] [2022-01-31 12:50:43,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:50:43,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 12:50:43,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:50:43,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 12:50:43,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 12:50:43,716 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:50:43,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:50:43,798 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-01-31 12:50:43,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 12:50:43,798 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:50:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:50:43,799 INFO L225 Difference]: With dead ends: 29 [2022-01-31 12:50:43,800 INFO L226 Difference]: Without dead ends: 26 [2022-01-31 12:50:43,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:50:43,801 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 17 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:50:43,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-01-31 12:50:43,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-31 12:50:43,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-01-31 12:50:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 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:50:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-01-31 12:50:43,818 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-01-31 12:50:43,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:50:43,818 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-01-31 12:50:43,819 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:50:43,819 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-01-31 12:50:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:50:43,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:50:43,820 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:50:43,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:50:43,820 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:50:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:50:43,820 INFO L85 PathProgramCache]: Analyzing trace with hash -610770875, now seen corresponding path program 1 times [2022-01-31 12:50:43,821 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:50:43,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17657429] [2022-01-31 12:50:43,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:43,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:50:43,844 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:50:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:43,881 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:50:43,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:50:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:43,949 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:50:43,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:50:43,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17657429] [2022-01-31 12:50:43,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17657429] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:50:43,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240370006] [2022-01-31 12:50:43,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:43,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:50:43,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:50:43,952 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:50:43,955 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:50:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:43,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:50:44,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:50:44,181 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:50:44,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:50:47,259 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:50:47,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240370006] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:50:47,260 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:50:47,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-01-31 12:50:47,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792976247] [2022-01-31 12:50:47,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:50:47,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 12:50:47,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:50:47,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 12:50:47,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:50:47,262 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:50:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:50:47,409 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-01-31 12:50:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:50:47,410 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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 17 [2022-01-31 12:50:47,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:50:47,411 INFO L225 Difference]: With dead ends: 34 [2022-01-31 12:50:47,411 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 12:50:47,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-01-31 12:50:47,413 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:50:47,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 74 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-01-31 12:50:47,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 12:50:47,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-01-31 12:50:47,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 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:50:47,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-01-31 12:50:47,417 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-01-31 12:50:47,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:50:47,418 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-01-31 12:50:47,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 11 states have internal predecessors, (31), 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:50:47,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-01-31 12:50:47,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:50:47,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:50:47,419 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:50:47,445 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:50:47,635 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:50:47,636 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:50:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:50:47,636 INFO L85 PathProgramCache]: Analyzing trace with hash 162216202, now seen corresponding path program 1 times [2022-01-31 12:50:47,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:50:47,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917463842] [2022-01-31 12:50:47,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:47,637 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:50:47,644 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:50:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:47,664 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:50:47,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:50:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:47,784 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:50:47,784 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:50:47,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917463842] [2022-01-31 12:50:47,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917463842] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:50:47,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477182855] [2022-01-31 12:50:47,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:47,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:50:47,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:50:47,786 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:50:47,789 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:50:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:47,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-31 12:50:47,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:50:47,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:50:47,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:50:47,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477182855] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:50:47,958 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:50:47,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-01-31 12:50:47,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341617038] [2022-01-31 12:50:47,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:50:47,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 12:50:47,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:50:47,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 12:50:47,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 12:50:47,960 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:50:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:50:47,980 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-01-31 12:50:47,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 12:50:47,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 12:50:47,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:50:47,982 INFO L225 Difference]: With dead ends: 32 [2022-01-31 12:50:47,982 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 12:50:47,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-31 12:50:47,985 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:50:47,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 53 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-01-31 12:50:47,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 12:50:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-01-31 12:50:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 21 states have internal predecessors, (32), 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:50:47,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-01-31 12:50:47,993 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-01-31 12:50:47,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:50:47,993 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-01-31 12:50:47,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:50:47,993 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-01-31 12:50:47,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:50:47,994 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:50:47,994 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:50:48,023 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:50:48,207 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:50:48,208 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:50:48,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:50:48,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1833749398, now seen corresponding path program 1 times [2022-01-31 12:50:48,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:50:48,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662913541] [2022-01-31 12:50:48,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:48,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:50:48,215 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:50:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:48,237 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:50:48,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:50:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:48,326 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:50:48,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:50:48,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662913541] [2022-01-31 12:50:48,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662913541] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:50:48,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106568192] [2022-01-31 12:50:48,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:48,327 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:50:48,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:50:48,328 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:50:48,329 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:50:48,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:48,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:50:48,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:50:48,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:50:48,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:50:48,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106568192] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:50:48,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:50:48,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2022-01-31 12:50:48,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357027709] [2022-01-31 12:50:48,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:50:48,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:50:48,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:50:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:50:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 12:50:48,490 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:50:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:50:48,513 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-01-31 12:50:48,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 12:50:48,514 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 12:50:48,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:50:48,514 INFO L225 Difference]: With dead ends: 35 [2022-01-31 12:50:48,514 INFO L226 Difference]: Without dead ends: 32 [2022-01-31 12:50:48,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:50:48,515 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:50:48,516 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-01-31 12:50:48,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-31 12:50:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-01-31 12:50:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:50:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-01-31 12:50:48,519 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 17 [2022-01-31 12:50:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:50:48,519 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-01-31 12:50:48,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:50:48,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-01-31 12:50:48,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:50:48,520 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:50:48,520 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:50:48,546 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:50:48,735 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:50:48,735 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:50:48,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:50:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2110277654, now seen corresponding path program 1 times [2022-01-31 12:50:48,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:50:48,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813133676] [2022-01-31 12:50:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:48,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:50:48,741 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:50:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:48,771 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:50:48,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:50:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:48,923 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:50:48,923 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:50:48,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813133676] [2022-01-31 12:50:48,923 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813133676] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:50:48,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952090822] [2022-01-31 12:50:48,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:48,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:50:48,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:50:48,925 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:50:48,926 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:50:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:48,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:50:48,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:50:49,476 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:50:49,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:50:53,932 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:50:53,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952090822] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:50:53,933 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:50:53,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-01-31 12:50:53,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931703539] [2022-01-31 12:50:53,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:50:53,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 12:50:53,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:50:53,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 12:50:53,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-01-31 12:50:53,935 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:50:54,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:50:54,787 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-01-31 12:50:54,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 12:50:54,788 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 12:50:54,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:50:54,789 INFO L225 Difference]: With dead ends: 52 [2022-01-31 12:50:54,789 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 12:50:54,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=146, Invalid=504, Unknown=0, NotChecked=0, Total=650 [2022-01-31 12:50:54,790 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:50:54,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 53 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-01-31 12:50:54,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 12:50:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-01-31 12:50:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 29 states have internal predecessors, (47), 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:50:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2022-01-31 12:50:54,794 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 51 transitions. Word has length 17 [2022-01-31 12:50:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:50:54,794 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 51 transitions. [2022-01-31 12:50:54,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:50:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 51 transitions. [2022-01-31 12:50:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:50:54,795 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:50:54,795 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:50:54,820 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:50:55,015 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:50:55,016 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:50:55,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:50:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1727307284, now seen corresponding path program 2 times [2022-01-31 12:50:55,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:50:55,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087185763] [2022-01-31 12:50:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:50:55,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:50:55,023 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:50:55,024 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:50:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:55,041 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:50:55,043 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:50:55,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:50:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:50:55,098 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:50:55,098 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:50:55,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087185763] [2022-01-31 12:50:55,098 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087185763] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:50:55,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084690118] [2022-01-31 12:50:55,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:50:55,099 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:50:55,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:50:55,104 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:50:55,105 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:50:55,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:50:55,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:50:55,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:50:55,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:50:55,268 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:50:55,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:50:59,590 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_23_31 Int)) (or (> 0 aux_mod_v_main_~x~0_23_31) (= aux_mod_v_main_~x~0_23_31 (mod c_main_~n~0 4294967296)) (>= aux_mod_v_main_~x~0_23_31 4294967296) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 (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 ((v_main_~x~0_24 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_24) (<= 1 v_it_5))) (let ((.cse1 (< 0 (mod (+ (* v_main_~x~0_24 4294967295) c_main_~x~0 c_main_~z~0) 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_23_31 Int)) (or (not (< v_main_~x~0_24 (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) (* v_main_~x~0_24 4294967295) c_main_~x~0 c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_24 v_it_5 1) (+ aux_mod_v_main_~x~0_23_31 (* aux_div_v_main_~x~0_23_31 4294967296)))))))) (or (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)) v_main_~x~0_24))) .cse1))) (not (< c_main_~x~0 v_main_~x~0_24)))) (not .cse0)))))) is different from false [2022-01-31 12:51:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 12:51:03,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084690118] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:51:03,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:51:03,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-01-31 12:51:03,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710899434] [2022-01-31 12:51:03,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:51:03,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 12:51:03,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:51:03,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 12:51:03,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=163, Unknown=2, NotChecked=26, Total=240 [2022-01-31 12:51:03,436 INFO L87 Difference]: Start difference. First operand 34 states and 51 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:51:03,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:51:03,584 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-01-31 12:51:03,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 12:51:03,584 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:51:03,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:51:03,585 INFO L225 Difference]: With dead ends: 45 [2022-01-31 12:51:03,585 INFO L226 Difference]: Without dead ends: 39 [2022-01-31 12:51:03,585 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=113, Invalid=351, Unknown=2, NotChecked=40, Total=506 [2022-01-31 12:51:03,586 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:51:03,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 46 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-01-31 12:51:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-31 12:51:03,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-01-31 12:51:03,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 28 states have internal predecessors, (45), 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:51:03,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-01-31 12:51:03,590 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2022-01-31 12:51:03,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:51:03,590 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-01-31 12:51:03,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:51:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2022-01-31 12:51:03,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:51:03,591 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:51:03,591 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:51:03,607 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:51:03,795 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:51:03,795 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:51:03,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:51:03,796 INFO L85 PathProgramCache]: Analyzing trace with hash 760455623, now seen corresponding path program 1 times [2022-01-31 12:51:03,796 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:51:03,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391957611] [2022-01-31 12:51:03,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:51:03,796 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:51:03,802 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:51:03,803 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:51:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:51:03,813 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:51:03,815 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:51:03,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:51:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:51:03,921 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:51:03,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:51:03,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391957611] [2022-01-31 12:51:03,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391957611] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:51:03,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319228185] [2022-01-31 12:51:03,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:51:03,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:51:03,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:51:03,923 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:51:03,924 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:51:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:51:03,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 12:51:03,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:51:04,115 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:51:04,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:51:11,092 WARN L860 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_29_31 Int) (aux_mod_v_main_~x~0_28_31 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_28_31) (< aux_mod_v_main_~x~0_29_31 0) (< 0 aux_mod_v_main_~x~0_29_31) (= aux_mod_v_main_~x~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31))) (and (not (= .cse0 c_main_~x~0)) (or (not (< 0 (mod c_main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< .cse0 c_main_~x~0))))) (< aux_mod_v_main_~x~0_28_31 0) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_28_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_5 1) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))) (<= 1 v_it_5))) (not (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_28_31 Int)) (not (= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))) .cse1))))) is different from true [2022-01-31 12:51:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 12:51:25,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319228185] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:51:25,258 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:51:25,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 10] total 18 [2022-01-31 12:51:25,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578465528] [2022-01-31 12:51:25,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:51:25,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 12:51:25,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:51:25,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 12:51:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=208, Unknown=6, NotChecked=30, Total=306 [2022-01-31 12:51:25,259 INFO L87 Difference]: Start difference. First operand 33 states and 49 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 12:51:27,493 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (= (+ (* (- 1) c_main_~n~0) c_main_~x~0) 0) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (<= c_main_~z~0 (* (div c_main_~z~0 4294967296) 4294967296)) (forall ((aux_mod_v_main_~x~0_29_31 Int) (aux_mod_v_main_~x~0_28_31 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_28_31) (< aux_mod_v_main_~x~0_29_31 0) (< 0 aux_mod_v_main_~x~0_29_31) (= aux_mod_v_main_~x~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31))) (and (not (= .cse0 c_main_~x~0)) (or (not (< 0 (mod c_main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< .cse0 c_main_~x~0))))) (< aux_mod_v_main_~x~0_28_31 0) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_28_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_5 1) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))) (<= 1 v_it_5))) (not (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_28_31 Int)) (not (= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))) .cse1))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-01-31 12:51:29,502 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (* (- 1) c_main_~n~0) c_main_~x~0) 0) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (<= c_main_~z~0 (* (div c_main_~z~0 4294967296) 4294967296)) (forall ((aux_mod_v_main_~x~0_29_31 Int) (aux_mod_v_main_~x~0_28_31 Int) (aux_div_v_main_~x~0_29_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_28_31) (< aux_mod_v_main_~x~0_29_31 0) (< 0 aux_mod_v_main_~x~0_29_31) (= aux_mod_v_main_~x~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31))) (and (not (= .cse0 c_main_~x~0)) (or (not (< 0 (mod c_main_~x~0 4294967296))) (exists ((v_it_4 Int)) (and (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< .cse0 c_main_~x~0))))) (< aux_mod_v_main_~x~0_28_31 0) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_28_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31 v_it_5 1) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))) (<= 1 v_it_5))) (not (< (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_28_31 Int)) (not (= (+ (* aux_div_v_main_~x~0_29_31 4294967296) aux_mod_v_main_~x~0_29_31) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))) .cse1)))))) is different from false [2022-01-31 12:51:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:51:29,586 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2022-01-31 12:51:29,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 12:51:29,586 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 18 [2022-01-31 12:51:29,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:51:29,587 INFO L225 Difference]: With dead ends: 43 [2022-01-31 12:51:29,587 INFO L226 Difference]: Without dead ends: 40 [2022-01-31 12:51:29,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=111, Invalid=355, Unknown=8, NotChecked=126, Total=600 [2022-01-31 12:51:29,588 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:51:29,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 60 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-01-31 12:51:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-31 12:51:29,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2022-01-31 12:51:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.6) internal successors, (48), 30 states have internal predecessors, (48), 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:51:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-01-31 12:51:29,591 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 18 [2022-01-31 12:51:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:51:29,591 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-01-31 12:51:29,591 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 12:51:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-01-31 12:51:29,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:51:29,592 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:51:29,592 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:51:29,617 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:51:29,810 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:51:29,811 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:51:29,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:51:29,811 INFO L85 PathProgramCache]: Analyzing trace with hash 571694412, now seen corresponding path program 1 times [2022-01-31 12:51:29,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:51:29,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415474112] [2022-01-31 12:51:29,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:51:29,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:51:29,816 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:51:29,817 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:51:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:51:29,844 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:51:29,852 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:51:29,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:51:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:51:29,962 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:51:29,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:51:29,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415474112] [2022-01-31 12:51:29,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415474112] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:51:29,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2059982094] [2022-01-31 12:51:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:51:29,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:51:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:51:29,964 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:51:29,994 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:51:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:51:30,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:51:30,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:51:30,113 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:51:30,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:52:18,027 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:52:18,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2059982094] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:52:18,027 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:52:18,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-01-31 12:52:18,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978707997] [2022-01-31 12:52:18,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:52:18,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 12:52:18,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:52:18,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 12:52:18,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=198, Unknown=16, NotChecked=0, Total=272 [2022-01-31 12:52:18,029 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 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:52:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:52:22,306 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2022-01-31 12:52:22,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 12:52:22,306 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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:52:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:52:22,307 INFO L225 Difference]: With dead ends: 47 [2022-01-31 12:52:22,307 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 12:52:22,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=114, Invalid=374, Unknown=18, NotChecked=0, Total=506 [2022-01-31 12:52:22,308 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:52:22,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 59 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-01-31 12:52:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 12:52:22,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-01-31 12:52:22,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.625) internal successors, (52), 32 states have internal predecessors, (52), 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:52:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2022-01-31 12:52:22,311 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 18 [2022-01-31 12:52:22,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:52:22,311 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2022-01-31 12:52:22,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 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:52:22,311 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2022-01-31 12:52:22,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:52:22,312 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:52:22,312 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:52:22,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-31 12:52:22,519 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:52:22,519 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:52:22,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:52:22,520 INFO L85 PathProgramCache]: Analyzing trace with hash -984935833, now seen corresponding path program 1 times [2022-01-31 12:52:22,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:52:22,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157393078] [2022-01-31 12:52:22,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:22,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:52:22,524 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:52:22,525 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:22,539 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:52:22,541 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:22,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:52:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:22,657 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:52:22,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:52:22,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157393078] [2022-01-31 12:52:22,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157393078] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:52:22,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844687771] [2022-01-31 12:52:22,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:22,657 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:52:22,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:52:22,664 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:52:22,666 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:52:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:22,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:52:22,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:52:22,921 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:52:22,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:52:37,879 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:52:37,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844687771] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:52:37,880 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:52:37,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2022-01-31 12:52:37,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126564299] [2022-01-31 12:52:37,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:52:37,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 12:52:37,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:52:37,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 12:52:37,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=213, Unknown=4, NotChecked=0, Total=272 [2022-01-31 12:52:37,881 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:38,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:52:38,242 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. [2022-01-31 12:52:38,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 12:52:38,242 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:52:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:52:38,243 INFO L225 Difference]: With dead ends: 48 [2022-01-31 12:52:38,243 INFO L226 Difference]: Without dead ends: 45 [2022-01-31 12:52:38,243 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=130, Invalid=466, Unknown=4, NotChecked=0, Total=600 [2022-01-31 12:52:38,243 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:52:38,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 73 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-01-31 12:52:38,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-31 12:52:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-01-31 12:52:38,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:38,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-01-31 12:52:38,247 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 18 [2022-01-31 12:52:38,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:52:38,247 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-01-31 12:52:38,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:38,247 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-01-31 12:52:38,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:52:38,247 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:52:38,248 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:52:38,264 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:52:38,451 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:52:38,451 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:52:38,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:52:38,452 INFO L85 PathProgramCache]: Analyzing trace with hash -211948756, now seen corresponding path program 1 times [2022-01-31 12:52:38,452 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:52:38,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326047606] [2022-01-31 12:52:38,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:38,452 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:52:38,456 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:52:38,457 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:52:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:38,474 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:52:38,478 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:52:38,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:52:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:38,559 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:52:38,559 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:52:38,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326047606] [2022-01-31 12:52:38,559 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326047606] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:52:38,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155290766] [2022-01-31 12:52:38,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:38,559 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:52:38,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:52:38,560 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:52:38,561 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:52:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:38,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:52:38,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:52:38,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:52:38,684 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:52:38,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155290766] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:52:38,684 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:52:38,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-01-31 12:52:38,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511507953] [2022-01-31 12:52:38,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:52:38,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:52:38,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:52:38,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:52:38,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 12:52:38,685 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:38,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:52:38,713 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2022-01-31 12:52:38,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 12:52:38,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:52:38,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:52:38,714 INFO L225 Difference]: With dead ends: 49 [2022-01-31 12:52:38,714 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 12:52:38,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:52:38,714 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:52:38,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-01-31 12:52:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 12:52:38,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-01-31 12:52:38,719 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:52:38,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-01-31 12:52:38,719 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 18 [2022-01-31 12:52:38,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:52:38,719 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2022-01-31 12:52:38,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2022-01-31 12:52:38,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:52:38,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:52:38,720 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:52:38,739 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:52:38,931 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:52:38,931 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:52:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:52:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash -967377177, now seen corresponding path program 1 times [2022-01-31 12:52:38,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:52:38,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563423470] [2022-01-31 12:52:38,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:38,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:52:38,936 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:38,937 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:38,953 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:38,962 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:52:39,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:39,133 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:52:39,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:52:39,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563423470] [2022-01-31 12:52:39,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563423470] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:52:39,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592811130] [2022-01-31 12:52:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:39,134 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:52:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:52:39,136 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:52:39,151 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:52:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:39,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 12:52:39,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:52:42,270 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:52:42,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:52:45,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 (let ((.cse2 (+ c_main_~n~0 (* (div c_main_~x~0 4294967296) 4294967296))) (.cse1 (* (div c_main_~n~0 4294967296) 4294967296))) (and (<= (+ .cse1 c_main_~x~0) .cse2) (< .cse2 (+ .cse1 c_main_~x~0 1))))) (or (and (forall ((aux_div_aux_mod_v_main_~z~0_39_31_121 Int) (aux_mod_aux_mod_v_main_~z~0_39_31_121 Int) (aux_div_v_main_~z~0_39_31 Int)) (let ((.cse5 (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296))) (let ((.cse4 (+ .cse5 (* 4294967296 aux_div_v_main_~z~0_39_31) aux_mod_aux_mod_v_main_~z~0_39_31_121)) (.cse3 (+ c_main_~x~0 c_main_~z~0))) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121)))) (< .cse3 .cse4) (not (< c_main_~x~0 (+ .cse5 aux_mod_aux_mod_v_main_~z~0_39_31_121))) (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121) c_main_~n~0) (< .cse4 .cse3) (>= aux_mod_aux_mod_v_main_~z~0_39_31_121 4294967296))))) (forall ((aux_div_aux_mod_v_main_~z~0_39_31_121 Int) (aux_mod_aux_mod_v_main_~z~0_39_31_121 Int) (aux_div_v_main_~z~0_39_31 Int)) (let ((.cse8 (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296))) (let ((.cse7 (+ .cse8 (* 4294967296 aux_div_v_main_~z~0_39_31) aux_mod_aux_mod_v_main_~z~0_39_31_121)) (.cse6 (+ c_main_~x~0 c_main_~z~0))) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ (* aux_div_aux_mod_v_main_~z~0_39_31_121 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121)))) (< .cse6 .cse7) (not (< c_main_~x~0 (+ .cse8 aux_mod_aux_mod_v_main_~z~0_39_31_121))) (< .cse7 .cse6) (> 0 aux_mod_aux_mod_v_main_~z~0_39_31_121) (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_aux_mod_v_main_~z~0_39_31_121 1))))))) (not .cse0)))) is different from false [2022-01-31 12:52:47,246 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-31 12:52:47,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592811130] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:52:47,247 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:52:47,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2022-01-31 12:52:47,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646054935] [2022-01-31 12:52:47,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:52:47,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 12:52:47,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:52:47,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 12:52:47,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=332, Unknown=1, NotChecked=38, Total=462 [2022-01-31 12:52:47,248 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. Second operand has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:52:48,499 INFO L93 Difference]: Finished difference Result 53 states and 80 transitions. [2022-01-31 12:52:48,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 12:52:48,500 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:52:48,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:52:48,500 INFO L225 Difference]: With dead ends: 53 [2022-01-31 12:52:48,500 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 12:52:48,501 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=191, Invalid=742, Unknown=1, NotChecked=58, Total=992 [2022-01-31 12:52:48,501 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:52:48,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 61 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-01-31 12:52:48,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 12:52:48,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-01-31 12:52:48,503 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:52:48,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-01-31 12:52:48,504 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 18 [2022-01-31 12:52:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:52:48,504 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-01-31 12:52:48,504 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.619047619047619) internal successors, (34), 19 states have internal predecessors, (34), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-01-31 12:52:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:52:48,505 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:52:48,505 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:52:48,523 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 12:52:48,707 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 12:52:48,707 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:52:48,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:52:48,708 INFO L85 PathProgramCache]: Analyzing trace with hash -194390100, now seen corresponding path program 1 times [2022-01-31 12:52:48,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:52:48,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882848234] [2022-01-31 12:52:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:48,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:52:48,712 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:48,713 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-01-31 12:52:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:48,723 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:48,728 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-01-31 12:52:48,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:52:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:48,848 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:52:48,848 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:52:48,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882848234] [2022-01-31 12:52:48,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882848234] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:52:48,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063962233] [2022-01-31 12:52:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:48,849 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:52:48,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:52:48,850 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 12:52:48,857 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 12:52:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:48,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:52:48,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:52:51,108 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:52:51,109 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:52:52,238 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:52:52,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063962233] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:52:52,238 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:52:52,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 19 [2022-01-31 12:52:52,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966647141] [2022-01-31 12:52:52,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:52:52,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 12:52:52,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:52:52,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 12:52:52,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-01-31 12:52:52,239 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:52:52,654 INFO L93 Difference]: Finished difference Result 59 states and 90 transitions. [2022-01-31 12:52:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 12:52:52,654 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:52:52,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:52:52,655 INFO L225 Difference]: With dead ends: 59 [2022-01-31 12:52:52,655 INFO L226 Difference]: Without dead ends: 55 [2022-01-31 12:52:52,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2022-01-31 12:52:52,656 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:52:52,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 76 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 87 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-01-31 12:52:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-31 12:52:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-01-31 12:52:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 37 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 12:52:52,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2022-01-31 12:52:52,660 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 64 transitions. Word has length 18 [2022-01-31 12:52:52,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:52:52,660 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 64 transitions. [2022-01-31 12:52:52,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 64 transitions. [2022-01-31 12:52:52,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:52:52,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:52:52,661 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:52:52,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-31 12:52:52,867 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 12:52:52,867 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:52:52,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:52:52,868 INFO L85 PathProgramCache]: Analyzing trace with hash -2001594489, now seen corresponding path program 1 times [2022-01-31 12:52:52,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:52:52,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446901759] [2022-01-31 12:52:52,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:52,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:52:52,871 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:52,872 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:52,890 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:52,896 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:53,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:52:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:53,096 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:52:53,096 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:52:53,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446901759] [2022-01-31 12:52:53,096 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446901759] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:52:53,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368859390] [2022-01-31 12:52:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:53,096 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:52:53,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:52:53,097 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 12:52:53,098 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 12:52:53,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:53,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:52:53,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:52:53,880 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:52:53,881 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:52:55,473 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:52:55,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368859390] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:52:55,474 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:52:55,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-01-31 12:52:55,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402965779] [2022-01-31 12:52:55,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:52:55,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 12:52:55,474 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:52:55,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 12:52:55,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:52:55,475 INFO L87 Difference]: Start difference. First operand 42 states and 64 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 15 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:59,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:52:59,248 INFO L93 Difference]: Finished difference Result 63 states and 98 transitions. [2022-01-31 12:52:59,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 12:52:59,249 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 15 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:52:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:52:59,249 INFO L225 Difference]: With dead ends: 63 [2022-01-31 12:52:59,250 INFO L226 Difference]: Without dead ends: 59 [2022-01-31 12:52:59,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=175, Invalid=581, Unknown=0, NotChecked=0, Total=756 [2022-01-31 12:52:59,250 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:52:59,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 57 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 61 Unchecked, 0.1s Time] [2022-01-31 12:52:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-31 12:52:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2022-01-31 12:52:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:59,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 66 transitions. [2022-01-31 12:52:59,253 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 66 transitions. Word has length 18 [2022-01-31 12:52:59,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:52:59,254 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 66 transitions. [2022-01-31 12:52:59,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 15 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:52:59,254 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 66 transitions. [2022-01-31 12:52:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:52:59,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:52:59,255 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:52:59,278 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 12:52:59,463 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 12:52:59,463 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:52:59,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:52:59,464 INFO L85 PathProgramCache]: Analyzing trace with hash 2104611596, now seen corresponding path program 1 times [2022-01-31 12:52:59,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:52:59,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518719950] [2022-01-31 12:52:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:59,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:52:59,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:59,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:59,493 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:59,503 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:52:59,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:52:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:59,692 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:52:59,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:52:59,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518719950] [2022-01-31 12:52:59,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518719950] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:52:59,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941911070] [2022-01-31 12:52:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:52:59,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:52:59,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:52:59,696 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 12:52:59,705 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 12:52:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:52:59,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-31 12:52:59,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:00,680 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-31 12:53:00,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:00,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 12:53:00,882 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: not dual finite connective at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:374) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:496) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:635) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-31 12:53:00,891 INFO L158 Benchmark]: Toolchain (without parser) took 140922.89ms. Allocated memory was 172.0MB in the beginning and 267.4MB in the end (delta: 95.4MB). Free memory was 116.4MB in the beginning and 108.3MB in the end (delta: 8.1MB). Peak memory consumption was 104.9MB. Max. memory is 8.0GB. [2022-01-31 12:53:00,891 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 12:53:00,893 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.80ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 116.2MB in the beginning and 196.8MB in the end (delta: -80.6MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-01-31 12:53:00,894 INFO L158 Benchmark]: Boogie Preprocessor took 61.67ms. Allocated memory is still 222.3MB. Free memory was 196.8MB in the beginning and 195.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 12:53:00,894 INFO L158 Benchmark]: RCFGBuilder took 218.91ms. Allocated memory is still 222.3MB. Free memory was 195.2MB in the beginning and 183.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 12:53:00,895 INFO L158 Benchmark]: IcfgTransformer took 2692.84ms. Allocated memory is still 222.3MB. Free memory was 183.2MB in the beginning and 156.4MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-01-31 12:53:00,896 INFO L158 Benchmark]: TraceAbstraction took 137694.62ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 155.9MB in the beginning and 108.3MB in the end (delta: 47.6MB). Peak memory consumption was 94.3MB. Max. memory is 8.0GB. [2022-01-31 12:53:00,899 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 172.0MB. Free memory is still 132.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.80ms. Allocated memory was 172.0MB in the beginning and 222.3MB in the end (delta: 50.3MB). Free memory was 116.2MB in the beginning and 196.8MB in the end (delta: -80.6MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 61.67ms. Allocated memory is still 222.3MB. Free memory was 196.8MB in the beginning and 195.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 218.91ms. Allocated memory is still 222.3MB. Free memory was 195.2MB in the beginning and 183.2MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 2692.84ms. Allocated memory is still 222.3MB. Free memory was 183.2MB in the beginning and 156.4MB in the end (delta: 26.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 137694.62ms. Allocated memory was 222.3MB in the beginning and 267.4MB in the end (delta: 45.1MB). Free memory was 155.9MB in the beginning and 108.3MB in the end (delta: 47.6MB). Peak memory consumption was 94.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: not dual finite connective de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: not dual finite connective: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:374) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-31 12:53:01,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...