/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-7968f31 [2022-03-17 15:24:39,984 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:24:39,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:24:40,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:24:40,029 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:24:40,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:24:40,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:24:40,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:24:40,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:24:40,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:24:40,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:24:40,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:24:40,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:24:40,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:24:40,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:24:40,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:24:40,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:24:40,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:24:40,039 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:24:40,040 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:24:40,041 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:24:40,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:24:40,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:24:40,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:24:40,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:24:40,047 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:24:40,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:24:40,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:24:40,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:24:40,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:24:40,049 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:24:40,049 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:24:40,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:24:40,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:24:40,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:24:40,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:24:40,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:24:40,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:24:40,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:24:40,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:24:40,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:24:40,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:24:40,054 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:24:40,060 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:24:40,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:24:40,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:24:40,061 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:24:40,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:24:40,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:24:40,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:24:40,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:24:40,063 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:24:40,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:24:40,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:24:40,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:24:40,064 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:24:40,064 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-03-17 15:24:40,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:24:40,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:24:40,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:24:40,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:24:40,241 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:24:40,242 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-03-17 15:24:40,284 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fafac484/7c1518c659184bf09745b833b1f75393/FLAGbbf52d800 [2022-03-17 15:24:40,593 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:24:40,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-03-17 15:24:40,598 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fafac484/7c1518c659184bf09745b833b1f75393/FLAGbbf52d800 [2022-03-17 15:24:41,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1fafac484/7c1518c659184bf09745b833b1f75393 [2022-03-17 15:24:41,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:24:41,058 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:24:41,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:24:41,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:24:41,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:24:41,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,063 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c5a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41, skipping insertion in model container [2022-03-17 15:24:41,063 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,068 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:24:41,078 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:24:41,197 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-03-17 15:24:41,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:24:41,228 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:24:41,271 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-03-17 15:24:41,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:24:41,293 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:24:41,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41 WrapperNode [2022-03-17 15:24:41,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:24:41,295 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:24:41,295 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:24:41,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:24:41,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:24:41,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:24:41,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:24:41,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:24:41,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:24:41,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:41,359 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-03-17 15:24:41,387 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-03-17 15:24:41,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:24:41,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:24:41,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:24:41,409 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:24:41,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:24:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:24:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:24:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:24:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:24:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-17 15:24:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:24:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:24:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:24:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:24:41,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:24:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:24:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:24:41,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:24:41,462 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:24:41,464 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:24:41,626 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:24:41,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:24:41,630 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-17 15:24:41,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:24:41 BoogieIcfgContainer [2022-03-17 15:24:41,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:24:41,632 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:24:41,632 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:24:41,644 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:24:41,646 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:24:41" (1/1) ... [2022-03-17 15:24:41,860 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-03-17 15:24:41,860 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-03-17 15:24:42,030 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-03-17 15:24:42,031 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-03-17 15:24:42,101 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-03-17 15:24:42,101 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-03-17 15:24:44,207 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-03-17 15:24:44,208 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-03-17 15:24:44,272 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-03-17 15:24:44,273 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-03-17 15:24:44,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:24:44 BasicIcfg [2022-03-17 15:24:44,276 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:24:44,277 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:24:44,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:24:44,280 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:24:44,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:24:41" (1/4) ... [2022-03-17 15:24:44,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca05ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:44, skipping insertion in model container [2022-03-17 15:24:44,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:41" (2/4) ... [2022-03-17 15:24:44,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca05ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:44, skipping insertion in model container [2022-03-17 15:24:44,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:24:41" (3/4) ... [2022-03-17 15:24:44,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ca05ca2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:24:44, skipping insertion in model container [2022-03-17 15:24:44,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:24:44" (4/4) ... [2022-03-17 15:24:44,283 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.cJordan [2022-03-17 15:24:44,286 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:24:44,286 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:24:44,340 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:24:44,350 INFO L340 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 [2022-03-17 15:24:44,350 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:24:44,362 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-03-17 15:24:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 15:24:44,368 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:44,368 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:44,369 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:44,376 INFO L85 PathProgramCache]: Analyzing trace with hash 702671213, now seen corresponding path program 1 times [2022-03-17 15:24:44,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:44,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585477336] [2022-03-17 15:24:44,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:44,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:44,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:44,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:44,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:44,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585477336] [2022-03-17 15:24:44,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585477336] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:24:44,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:24:44,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 15:24:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501063242] [2022-03-17 15:24:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:24:44,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 15:24:44,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:44,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 15:24:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:24:44,540 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-03-17 15:24:44,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:44,568 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-03-17 15:24:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 15:24:44,570 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-03-17 15:24:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:44,578 INFO L225 Difference]: With dead ends: 24 [2022-03-17 15:24:44,578 INFO L226 Difference]: Without dead ends: 17 [2022-03-17 15:24:44,579 INFO L911 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-03-17 15:24:44,582 INFO L912 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-03-17 15:24:44,583 INFO L913 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-03-17 15:24:44,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-17 15:24:44,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-03-17 15:24:44,604 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-03-17 15:24:44,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-03-17 15:24:44,605 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-03-17 15:24:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:44,606 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-03-17 15:24:44,606 INFO L479 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-03-17 15:24:44,606 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-03-17 15:24:44,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 15:24:44,606 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:44,607 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:44,607 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:24:44,607 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:44,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:44,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1128942900, now seen corresponding path program 1 times [2022-03-17 15:24:44,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:44,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847606762] [2022-03-17 15:24:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:44,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:44,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:44,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:44,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847606762] [2022-03-17 15:24:44,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847606762] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:24:44,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:24:44,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 15:24:44,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885337664] [2022-03-17 15:24:44,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:24:44,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 15:24:44,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 15:24:44,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 15:24:44,798 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-03-17 15:24:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:44,891 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-03-17 15:24:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 15:24:44,891 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-03-17 15:24:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:44,893 INFO L225 Difference]: With dead ends: 29 [2022-03-17 15:24:44,893 INFO L226 Difference]: Without dead ends: 26 [2022-03-17 15:24:44,893 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-17 15:24:44,894 INFO L912 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-03-17 15:24:44,895 INFO L913 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-03-17 15:24:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-03-17 15:24:44,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-03-17 15:24:44,902 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-03-17 15:24:44,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-03-17 15:24:44,907 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-03-17 15:24:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:44,907 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-03-17 15:24:44,907 INFO L479 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-03-17 15:24:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-03-17 15:24:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:24:44,908 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:44,908 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:44,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:24:44,908 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:44,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:44,909 INFO L85 PathProgramCache]: Analyzing trace with hash -610770875, now seen corresponding path program 1 times [2022-03-17 15:24:44,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:44,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169386979] [2022-03-17 15:24:44,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:44,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:44,929 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-03-17 15:24:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:44,968 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-03-17 15:24:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:45,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:45,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169386979] [2022-03-17 15:24:45,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169386979] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:24:45,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750687531] [2022-03-17 15:24:45,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:24:45,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:45,052 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-03-17 15:24:45,067 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-03-17 15:24:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:45,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:24:45,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:24:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:45,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:24:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:49,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750687531] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:24:49,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:24:49,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2022-03-17 15:24:49,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097684498] [2022-03-17 15:24:49,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:24:49,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:24:49,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:49,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:24:49,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-03-17 15:24:49,767 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-03-17 15:24:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:50,088 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-03-17 15:24:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:24:50,089 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-03-17 15:24:50,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:50,090 INFO L225 Difference]: With dead ends: 34 [2022-03-17 15:24:50,090 INFO L226 Difference]: Without dead ends: 31 [2022-03-17 15:24:50,091 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=82, Invalid=259, Unknown=1, NotChecked=0, Total=342 [2022-03-17 15:24:50,092 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 21 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-03-17 15:24:50,092 INFO L913 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-03-17 15:24:50,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-17 15:24:50,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-03-17 15:24:50,094 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-03-17 15:24:50,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-03-17 15:24:50,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-03-17 15:24:50,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:50,095 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-03-17 15:24:50,095 INFO L479 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-03-17 15:24:50,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-03-17 15:24:50,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:24:50,096 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:50,096 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:50,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-03-17 15:24:50,307 WARN L460 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-03-17 15:24:50,308 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash 162216202, now seen corresponding path program 1 times [2022-03-17 15:24:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:50,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831979902] [2022-03-17 15:24:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:50,316 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-03-17 15:24:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:50,328 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-03-17 15:24:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:50,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:50,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831979902] [2022-03-17 15:24:50,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831979902] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:24:50,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961420451] [2022-03-17 15:24:50,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:50,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:24:50,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:50,606 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-03-17 15:24:50,607 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-03-17 15:24:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:50,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:24:50,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:24:50,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:24:50,852 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:24:50,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961420451] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:24:50,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:24:50,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-03-17 15:24:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514936647] [2022-03-17 15:24:50,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:24:50,853 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 15:24:50,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:50,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 15:24:50,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-17 15:24:50,854 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-03-17 15:24:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:50,922 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-03-17 15:24:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 15:24:50,922 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-03-17 15:24:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:50,923 INFO L225 Difference]: With dead ends: 32 [2022-03-17 15:24:50,923 INFO L226 Difference]: Without dead ends: 29 [2022-03-17 15:24:50,924 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-03-17 15:24:50,924 INFO L912 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-03-17 15:24:50,925 INFO L913 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-03-17 15:24:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-17 15:24:50,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-03-17 15:24:50,928 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-03-17 15:24:50,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-03-17 15:24:50,928 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 17 [2022-03-17 15:24:50,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:50,929 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-03-17 15:24:50,929 INFO L479 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-03-17 15:24:50,929 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-03-17 15:24:50,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:24:50,929 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:50,930 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:50,952 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-03-17 15:24:51,139 WARN L460 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-03-17 15:24:51,140 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:51,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:51,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1833749398, now seen corresponding path program 1 times [2022-03-17 15:24:51,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:51,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090202808] [2022-03-17 15:24:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:51,146 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-03-17 15:24:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:51,162 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-03-17 15:24:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:51,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:51,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:51,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090202808] [2022-03-17 15:24:51,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090202808] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:24:51,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869361011] [2022-03-17 15:24:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:51,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:24:51,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:51,360 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-03-17 15:24:51,363 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-03-17 15:24:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:51,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:24:51,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:24:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:24:51,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:24:51,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869361011] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:24:51,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:24:51,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 13 [2022-03-17 15:24:51,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062958539] [2022-03-17 15:24:51,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:24:51,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:24:51,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:51,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:24:51,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:24:51,571 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-03-17 15:24:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:51,622 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2022-03-17 15:24:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 15:24:51,623 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-03-17 15:24:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:51,623 INFO L225 Difference]: With dead ends: 35 [2022-03-17 15:24:51,624 INFO L226 Difference]: Without dead ends: 32 [2022-03-17 15:24:51,624 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-17 15:24:51,624 INFO L912 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-03-17 15:24:51,625 INFO L913 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-03-17 15:24:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-17 15:24:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-03-17 15:24:51,626 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-03-17 15:24:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-03-17 15:24:51,627 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 17 [2022-03-17 15:24:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:51,627 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-03-17 15:24:51,627 INFO L479 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-03-17 15:24:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-03-17 15:24:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:24:51,628 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:51,628 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:51,661 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-03-17 15:24:51,828 WARN L460 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-03-17 15:24:51,829 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:51,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash -2110277654, now seen corresponding path program 1 times [2022-03-17 15:24:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:51,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365001706] [2022-03-17 15:24:51,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:51,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:51,833 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-03-17 15:24:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:51,872 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-03-17 15:24:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:52,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:52,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365001706] [2022-03-17 15:24:52,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365001706] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:24:52,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844438] [2022-03-17 15:24:52,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:52,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:24:52,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:52,146 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-03-17 15:24:52,147 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-03-17 15:24:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:52,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:24:52,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:24:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:53,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:24:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:56,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844438] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:24:56,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:24:56,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-17 15:24:56,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883389576] [2022-03-17 15:24:56,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:24:56,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-17 15:24:56,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:56,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-17 15:24:56,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=215, Unknown=1, NotChecked=0, Total=272 [2022-03-17 15:24:56,968 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-03-17 15:24:58,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:58,159 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-03-17 15:24:58,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-17 15:24:58,159 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-03-17 15:24:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:58,160 INFO L225 Difference]: With dead ends: 52 [2022-03-17 15:24:58,160 INFO L226 Difference]: Without dead ends: 48 [2022-03-17 15:24:58,160 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=146, Invalid=503, Unknown=1, NotChecked=0, Total=650 [2022-03-17 15:24:58,161 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 47 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:24:58,162 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 53 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2022-03-17 15:24:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-17 15:24:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-03-17 15:24:58,164 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-03-17 15:24:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 51 transitions. [2022-03-17 15:24:58,165 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 51 transitions. Word has length 17 [2022-03-17 15:24:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:58,165 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 51 transitions. [2022-03-17 15:24:58,165 INFO L479 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-03-17 15:24:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 51 transitions. [2022-03-17 15:24:58,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:24:58,165 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:58,165 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:58,196 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-03-17 15:24:58,379 WARN L460 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-03-17 15:24:58,379 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:58,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1727307284, now seen corresponding path program 2 times [2022-03-17 15:24:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:58,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610702209] [2022-03-17 15:24:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:58,385 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-03-17 15:24:58,385 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-03-17 15:24:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:58,397 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-03-17 15:24:58,398 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-03-17 15:24:58,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:58,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:24:58,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610702209] [2022-03-17 15:24:58,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610702209] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:24:58,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202845754] [2022-03-17 15:24:58,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:24:58,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:24:58,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:58,544 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-03-17 15:24:58,546 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-03-17 15:24:58,572 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:24:58,572 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:24:58,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:24:58,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:24:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:24:58,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:25:05,646 WARN L833 $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-03-17 15:25:11,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-17 15:25:11,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202845754] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:11,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:11,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-03-17 15:25:11,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519113166] [2022-03-17 15:25:11,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:11,074 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 15:25:11,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:11,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 15:25:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=162, Unknown=3, NotChecked=26, Total=240 [2022-03-17 15:25:11,075 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-03-17 15:25:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:11,459 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-03-17 15:25:11,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 15:25:11,459 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-03-17 15:25:11,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:11,460 INFO L225 Difference]: With dead ends: 45 [2022-03-17 15:25:11,460 INFO L226 Difference]: Without dead ends: 39 [2022-03-17 15:25:11,461 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=113, Invalid=350, Unknown=3, NotChecked=40, Total=506 [2022-03-17 15:25:11,461 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:11,461 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 46 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 61 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-03-17 15:25:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-03-17 15:25:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-03-17 15:25:11,463 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-03-17 15:25:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 49 transitions. [2022-03-17 15:25:11,464 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 49 transitions. Word has length 18 [2022-03-17 15:25:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:11,464 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 49 transitions. [2022-03-17 15:25:11,464 INFO L479 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-03-17 15:25:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 49 transitions. [2022-03-17 15:25:11,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:11,464 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:11,465 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:11,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-17 15:25:11,675 WARN L460 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-03-17 15:25:11,676 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:11,676 INFO L85 PathProgramCache]: Analyzing trace with hash 760455623, now seen corresponding path program 1 times [2022-03-17 15:25:11,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:11,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508483425] [2022-03-17 15:25:11,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:11,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:11,685 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-03-17 15:25:11,686 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-03-17 15:25:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:11,704 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-03-17 15:25:11,706 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-03-17 15:25:11,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:11,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:11,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508483425] [2022-03-17 15:25:11,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508483425] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:11,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185891904] [2022-03-17 15:25:11,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:11,945 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-03-17 15:25:11,946 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-03-17 15:25:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:11,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 15:25:11,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:12,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:12,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:10,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:10,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185891904] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:10,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:10,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 10] total 18 [2022-03-17 15:26:10,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588864502] [2022-03-17 15:26:10,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:10,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 15:26:10,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:10,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 15:26:10,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=227, Unknown=16, NotChecked=0, Total=306 [2022-03-17 15:26:10,466 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-03-17 15:26:10,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:10,848 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-03-17 15:26:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 15:26:10,849 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-03-17 15:26:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:10,849 INFO L225 Difference]: With dead ends: 45 [2022-03-17 15:26:10,849 INFO L226 Difference]: Without dead ends: 42 [2022-03-17 15:26:10,850 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 43.0s TimeCoverageRelationStatistics Valid=109, Invalid=381, Unknown=16, NotChecked=0, Total=506 [2022-03-17 15:26:10,850 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 30 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:10,850 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 73 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-03-17 15:26:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-17 15:26:10,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2022-03-17 15:26:10,853 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-03-17 15:26:10,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2022-03-17 15:26:10,854 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 18 [2022-03-17 15:26:10,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:10,854 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2022-03-17 15:26:10,854 INFO L479 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-03-17 15:26:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2022-03-17 15:26:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:10,855 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:10,855 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:10,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-17 15:26:11,056 WARN L460 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-03-17 15:26:11,056 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:11,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:11,057 INFO L85 PathProgramCache]: Analyzing trace with hash 571694412, now seen corresponding path program 1 times [2022-03-17 15:26:11,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:11,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294375698] [2022-03-17 15:26:11,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:11,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:11,065 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-03-17 15:26:11,066 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-03-17 15:26:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:11,078 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-03-17 15:26:11,081 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-03-17 15:26:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:11,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:11,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:11,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294375698] [2022-03-17 15:26:11,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294375698] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:11,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239584375] [2022-03-17 15:26:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:11,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:11,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:11,289 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-03-17 15:26:11,289 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-03-17 15:26:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:11,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:26:11,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:11,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:11,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:22,019 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_32_31 Int)) (or (>= aux_mod_v_main_~x~0_32_31 4294967296) (> 0 aux_mod_v_main_~x~0_32_31) (= aux_mod_v_main_~x~0_32_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296))) (.cse1 (forall ((aux_div_v_main_~x~0_32_31 Int)) (not (= (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296)) c_main_~x~0))))) (and (or .cse0 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse1 .cse2) (or (forall ((aux_div_v_main_~x~0_32_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296)))))) (not .cse2))))) (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_32_31 Int) (aux_mod_v_main_~z~0_30_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (<= (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296)) c_main_~x~0) (<= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_30_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296))))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (<= 4294967296 aux_mod_v_main_~z~0_30_31) (<= aux_mod_v_main_~z~0_30_31 0))) (or (forall ((aux_mod_v_main_~z~0_30_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< 0 aux_mod_v_main_~z~0_30_31) (<= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) c_main_~z~0) (< aux_mod_v_main_~z~0_30_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))))) .cse1))))))) is different from false [2022-03-17 15:26:25,904 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~x~0_32_31 Int)) (or (>= aux_mod_v_main_~x~0_32_31 4294967296) (> 0 aux_mod_v_main_~x~0_32_31) (= aux_mod_v_main_~x~0_32_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296))) (.cse1 (forall ((aux_div_v_main_~x~0_32_31 Int)) (not (= (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296)) c_main_~x~0))))) (and (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_32_31 Int) (aux_mod_v_main_~z~0_30_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (<= (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296)) c_main_~x~0) (<= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_30_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_32_31 (* aux_div_v_main_~x~0_32_31 4294967296))))) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))) (<= 4294967296 aux_mod_v_main_~z~0_30_31) (<= aux_mod_v_main_~z~0_30_31 0))) (or (forall ((aux_mod_v_main_~z~0_30_31 Int) (aux_div_v_main_~z~0_30_31 Int)) (or (< 0 aux_mod_v_main_~z~0_30_31) (<= (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31) c_main_~z~0) (< aux_mod_v_main_~z~0_30_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_30_31) aux_mod_v_main_~z~0_30_31)))))) .cse1))) (or .cse0 .cse1))))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-03-17 15:26:28,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:26:28,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239584375] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:28,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:28,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2022-03-17 15:26:28,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476881855] [2022-03-17 15:26:28,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:28,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-17 15:26:28,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:28,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-17 15:26:28,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=160, Unknown=3, NotChecked=54, Total=272 [2022-03-17 15:26:28,089 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-03-17 15:26:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:28,470 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2022-03-17 15:26:28,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 15:26:28,471 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-03-17 15:26:28,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:28,471 INFO L225 Difference]: With dead ends: 47 [2022-03-17 15:26:28,471 INFO L226 Difference]: Without dead ends: 44 [2022-03-17 15:26:28,472 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=108, Invalid=317, Unknown=3, NotChecked=78, Total=506 [2022-03-17 15:26:28,473 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:28,473 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 53 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 68 Invalid, 0 Unknown, 73 Unchecked, 0.1s Time] [2022-03-17 15:26:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-17 15:26:28,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2022-03-17 15:26:28,481 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-03-17 15:26:28,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2022-03-17 15:26:28,481 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 18 [2022-03-17 15:26:28,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:28,481 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2022-03-17 15:26:28,481 INFO L479 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-03-17 15:26:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2022-03-17 15:26:28,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:28,482 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:28,482 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:28,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-17 15:26:28,695 WARN L460 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-03-17 15:26:28,696 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:28,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:28,696 INFO L85 PathProgramCache]: Analyzing trace with hash -984935833, now seen corresponding path program 1 times [2022-03-17 15:26:28,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:28,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688933506] [2022-03-17 15:26:28,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:28,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:28,699 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-03-17 15:26:28,701 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-03-17 15:26:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:28,722 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-03-17 15:26:28,735 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-03-17 15:26:29,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:29,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:29,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688933506] [2022-03-17 15:26:29,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688933506] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:29,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719798450] [2022-03-17 15:26:29,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:29,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:29,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:29,031 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-03-17 15:26:29,032 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-03-17 15:26:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:29,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:26:29,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:29,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:29,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:47,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719798450] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:47,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:47,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 17 [2022-03-17 15:26:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661329989] [2022-03-17 15:26:47,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:47,350 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-17 15:26:47,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:47,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-17 15:26:47,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=211, Unknown=6, NotChecked=0, Total=272 [2022-03-17 15:26:47,351 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-03-17 15:26:47,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:47,821 INFO L93 Difference]: Finished difference Result 48 states and 73 transitions. [2022-03-17 15:26:47,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:26:47,821 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-03-17 15:26:47,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:47,822 INFO L225 Difference]: With dead ends: 48 [2022-03-17 15:26:47,822 INFO L226 Difference]: Without dead ends: 45 [2022-03-17 15:26:47,822 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=130, Invalid=464, Unknown=6, NotChecked=0, Total=600 [2022-03-17 15:26:47,823 INFO L912 BasicCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:47,823 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 74 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 83 Invalid, 0 Unknown, 43 Unchecked, 0.2s Time] [2022-03-17 15:26:47,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-17 15:26:47,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-03-17 15:26:47,825 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-03-17 15:26:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-03-17 15:26:47,825 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 18 [2022-03-17 15:26:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:47,825 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-03-17 15:26:47,825 INFO L479 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-03-17 15:26:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-03-17 15:26:47,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:47,826 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:47,826 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:47,851 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-03-17 15:26:48,026 WARN L460 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-03-17 15:26:48,026 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:48,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:48,027 INFO L85 PathProgramCache]: Analyzing trace with hash -211948756, now seen corresponding path program 1 times [2022-03-17 15:26:48,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:48,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038476276] [2022-03-17 15:26:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:48,031 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-03-17 15:26:48,032 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-03-17 15:26:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:48,044 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-03-17 15:26:48,046 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-03-17 15:26:48,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:48,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:48,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038476276] [2022-03-17 15:26:48,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038476276] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:48,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791657488] [2022-03-17 15:26:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:48,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:48,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:48,262 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-03-17 15:26:48,263 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-03-17 15:26:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:48,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:26:48,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:48,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:26:48,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:26:48,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791657488] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:26:48,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:26:48,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-03-17 15:26:48,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521614795] [2022-03-17 15:26:48,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:26:48,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:26:48,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:48,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:26:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-17 15:26:48,513 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-03-17 15:26:48,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:48,564 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2022-03-17 15:26:48,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 15:26:48,564 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-03-17 15:26:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:48,565 INFO L225 Difference]: With dead ends: 49 [2022-03-17 15:26:48,565 INFO L226 Difference]: Without dead ends: 46 [2022-03-17 15:26:48,565 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-03-17 15:26:48,565 INFO L912 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-03-17 15:26:48,565 INFO L913 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-03-17 15:26:48,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-17 15:26:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-03-17 15:26:48,570 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-03-17 15:26:48,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-03-17 15:26:48,570 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 18 [2022-03-17 15:26:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:48,570 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2022-03-17 15:26:48,570 INFO L479 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-03-17 15:26:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2022-03-17 15:26:48,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:48,571 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:48,571 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:48,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-17 15:26:48,787 WARN L460 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-03-17 15:26:48,788 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:48,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash -967377177, now seen corresponding path program 1 times [2022-03-17 15:26:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:48,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470677479] [2022-03-17 15:26:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:48,792 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-03-17 15:26:48,793 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-03-17 15:26:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:48,806 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-03-17 15:26:48,813 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-03-17 15:26:49,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:49,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:49,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:49,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470677479] [2022-03-17 15:26:49,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470677479] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:49,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197293403] [2022-03-17 15:26:49,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:49,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:49,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:49,177 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-03-17 15:26:49,178 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-03-17 15:26:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:49,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 15:26:49,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:50,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:50,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:09,003 WARN L232 SmtUtils]: Spent 10.32s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:27:19,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197293403] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:19,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:19,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 22 [2022-03-17 15:27:19,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97030939] [2022-03-17 15:27:19,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:19,233 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-17 15:27:19,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:19,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-17 15:27:19,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=362, Unknown=7, NotChecked=0, Total=462 [2022-03-17 15:27:19,234 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-03-17 15:27:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:22,615 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-03-17 15:27:22,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:27:22,615 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-03-17 15:27:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:22,616 INFO L225 Difference]: With dead ends: 50 [2022-03-17 15:27:22,616 INFO L226 Difference]: Without dead ends: 45 [2022-03-17 15:27:22,616 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 30.4s TimeCoverageRelationStatistics Valid=176, Invalid=628, Unknown=8, NotChecked=0, Total=812 [2022-03-17 15:27:22,617 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:22,617 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 61 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-03-17 15:27:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-17 15:27:22,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-03-17 15:27:22,622 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-03-17 15:27:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-03-17 15:27:22,625 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 18 [2022-03-17 15:27:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:22,627 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-03-17 15:27:22,627 INFO L479 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-03-17 15:27:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-03-17 15:27:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:27:22,628 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:22,628 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:27:22,646 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-03-17 15:27:22,837 WARN L460 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-03-17 15:27:22,837 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:22,838 INFO L85 PathProgramCache]: Analyzing trace with hash -194390100, now seen corresponding path program 1 times [2022-03-17 15:27:22,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:22,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818725684] [2022-03-17 15:27:22,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:22,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:22,841 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-03-17 15:27:22,842 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-03-17 15:27:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:22,851 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-03-17 15:27:22,855 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-03-17 15:27:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:23,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818725684] [2022-03-17 15:27:23,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818725684] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:23,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658448696] [2022-03-17 15:27:23,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:23,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:23,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:23,152 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-03-17 15:27:23,156 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-03-17 15:27:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:23,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:27:23,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:24,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:28,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [658448696] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:28,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:28,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 19 [2022-03-17 15:27:28,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882792845] [2022-03-17 15:27:28,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:28,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 15:27:28,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:28,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 15:27:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=262, Unknown=0, NotChecked=0, Total=342 [2022-03-17 15:27:28,950 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-03-17 15:27:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:29,574 INFO L93 Difference]: Finished difference Result 60 states and 91 transitions. [2022-03-17 15:27:29,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-17 15:27:29,574 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-03-17 15:27:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:29,575 INFO L225 Difference]: With dead ends: 60 [2022-03-17 15:27:29,575 INFO L226 Difference]: Without dead ends: 56 [2022-03-17 15:27:29,575 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2022-03-17 15:27:29,576 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:29,576 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 64 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 90 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2022-03-17 15:27:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-17 15:27:29,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2022-03-17 15:27:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 36 states have internal predecessors, (58), 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-03-17 15:27:29,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 62 transitions. [2022-03-17 15:27:29,578 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 62 transitions. Word has length 18 [2022-03-17 15:27:29,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:29,578 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-03-17 15:27:29,578 INFO L479 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-03-17 15:27:29,578 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 62 transitions. [2022-03-17 15:27:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:27:29,578 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:29,578 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:27:29,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-17 15:27:29,786 WARN L460 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-03-17 15:27:29,786 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:29,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:29,786 INFO L85 PathProgramCache]: Analyzing trace with hash -2001594489, now seen corresponding path program 1 times [2022-03-17 15:27:29,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:29,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097230932] [2022-03-17 15:27:29,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:29,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:29,790 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-03-17 15:27:29,790 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-03-17 15:27:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:29,808 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-03-17 15:27:29,815 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-03-17 15:27:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:30,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:30,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:27:30,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:30,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097230932] [2022-03-17 15:27:30,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097230932] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:30,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224171334] [2022-03-17 15:27:30,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:30,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:30,187 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-03-17 15:27:30,188 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-03-17 15:27:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:30,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:27:30,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:27:31,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:35,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:27:35,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224171334] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:35,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:35,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-03-17 15:27:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58796637] [2022-03-17 15:27:35,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:35,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 15:27:35,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:35,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 15:27:35,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=242, Unknown=1, NotChecked=0, Total=306 [2022-03-17 15:27:35,657 INFO L87 Difference]: Start difference. First operand 41 states and 62 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-03-17 15:27:37,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:37,588 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2022-03-17 15:27:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 15:27:37,589 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-03-17 15:27:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:37,589 INFO L225 Difference]: With dead ends: 58 [2022-03-17 15:27:37,589 INFO L226 Difference]: Without dead ends: 55 [2022-03-17 15:27:37,589 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=139, Invalid=460, Unknown=1, NotChecked=0, Total=600 [2022-03-17 15:27:37,590 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:37,590 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 56 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 89 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-03-17 15:27:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-17 15:27:37,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2022-03-17 15:27:37,592 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-03-17 15:27:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2022-03-17 15:27:37,593 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 64 transitions. Word has length 18 [2022-03-17 15:27:37,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:37,593 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 64 transitions. [2022-03-17 15:27:37,593 INFO L479 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-03-17 15:27:37,593 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 64 transitions. [2022-03-17 15:27:37,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:27:37,593 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:37,593 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:27:37,612 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-03-17 15:27:37,812 WARN L460 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-03-17 15:27:37,813 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:37,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:37,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2104611596, now seen corresponding path program 1 times [2022-03-17 15:27:37,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:37,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632302978] [2022-03-17 15:27:37,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:37,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:37,816 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-03-17 15:27:37,819 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-03-17 15:27:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:37,833 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-03-17 15:27:37,842 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-03-17 15:27:38,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:38,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:38,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:38,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:38,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632302978] [2022-03-17 15:27:38,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632302978] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:38,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404099835] [2022-03-17 15:27:38,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:38,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:38,290 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-03-17 15:27:38,296 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-03-17 15:27:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:38,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 15:27:38,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:40,274 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-03-17 15:27:40,291 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-03-17 15:27:40,475 WARN L460 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-03-17 15:27:40,475 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:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:596) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) 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-03-17 15:27:40,478 INFO L158 Benchmark]: Toolchain (without parser) took 179420.04ms. Allocated memory was 166.7MB in the beginning and 211.8MB in the end (delta: 45.1MB). Free memory was 111.5MB in the beginning and 99.1MB in the end (delta: 12.5MB). Peak memory consumption was 58.8MB. Max. memory is 8.0GB. [2022-03-17 15:27:40,478 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 166.7MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-17 15:27:40,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.12ms. Allocated memory was 166.7MB in the beginning and 211.8MB in the end (delta: 45.1MB). Free memory was 111.4MB in the beginning and 186.1MB in the end (delta: -74.7MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. [2022-03-17 15:27:40,479 INFO L158 Benchmark]: Boogie Preprocessor took 37.61ms. Allocated memory is still 211.8MB. Free memory was 186.1MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-17 15:27:40,479 INFO L158 Benchmark]: RCFGBuilder took 297.52ms. Allocated memory is still 211.8MB. Free memory was 184.5MB in the beginning and 173.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-17 15:27:40,479 INFO L158 Benchmark]: IcfgTransformer took 2644.64ms. Allocated memory is still 211.8MB. Free memory was 173.5MB in the beginning and 146.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2022-03-17 15:27:40,479 INFO L158 Benchmark]: TraceAbstraction took 176200.47ms. Allocated memory is still 211.8MB. Free memory was 146.2MB in the beginning and 99.1MB in the end (delta: 47.2MB). Peak memory consumption was 47.5MB. Max. memory is 8.0GB. [2022-03-17 15:27:40,480 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.09ms. Allocated memory is still 166.7MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.12ms. Allocated memory was 166.7MB in the beginning and 211.8MB in the end (delta: 45.1MB). Free memory was 111.4MB in the beginning and 186.1MB in the end (delta: -74.7MB). Peak memory consumption was 16.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.61ms. Allocated memory is still 211.8MB. Free memory was 186.1MB in the beginning and 184.5MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 297.52ms. Allocated memory is still 211.8MB. Free memory was 184.5MB in the beginning and 173.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * IcfgTransformer took 2644.64ms. Allocated memory is still 211.8MB. Free memory was 173.5MB in the beginning and 146.2MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * TraceAbstraction took 176200.47ms. Allocated memory is still 211.8MB. Free memory was 146.2MB in the beginning and 99.1MB in the end (delta: 47.2MB). Peak memory consumption was 47.5MB. 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-03-17 15:27:40,623 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...