/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 04:06:53,155 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:06:53,157 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:06:53,179 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:06:53,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:06:53,182 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:06:53,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:06:53,191 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:06:53,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:06:53,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:06:53,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:06:53,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:06:53,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:06:53,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:06:53,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:06:53,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:06:53,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:06:53,197 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:06:53,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:06:53,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:06:53,199 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:06:53,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:06:53,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:06:53,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:06:53,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:06:53,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:06:53,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:06:53,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:06:53,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:06:53,204 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:06:53,205 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:06:53,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:06:53,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:06:53,206 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:06:53,206 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:06:53,207 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:06:53,207 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:06:53,208 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:06:53,208 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:06:53,208 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:06:53,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:06:53,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:06:53,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:06:53,216 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:06:53,216 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:06:53,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:06:53,217 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:06:53,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:06:53,218 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:06:53,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:06:53,219 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:06:53,219 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:06:53,219 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:06:53,219 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:06:53,219 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:06:53,219 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:06:53,219 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:06:53,220 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:06:53,220 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-20 04:06:53,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:06:53,414 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:06:53,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:06:53,417 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:06:53,418 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:06:53,419 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-03-20 04:06:53,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1aef5160/9e667e4cceb347da917b1b958ace6da7/FLAGb438c0e2e [2022-03-20 04:06:53,777 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:06:53,777 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c [2022-03-20 04:06:53,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1aef5160/9e667e4cceb347da917b1b958ace6da7/FLAGb438c0e2e [2022-03-20 04:06:54,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1aef5160/9e667e4cceb347da917b1b958ace6da7 [2022-03-20 04:06:54,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:06:54,227 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:06:54,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:06:54,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:06:54,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:06:54,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a7f32e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54, skipping insertion in model container [2022-03-20 04:06:54,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,248 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:06:54,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:06:54,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c[368,381] [2022-03-20 04:06:54,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:06:54,442 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:06:54,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de62.c[368,381] [2022-03-20 04:06:54,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:06:54,472 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:06:54,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54 WrapperNode [2022-03-20 04:06:54,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:06:54,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:06:54,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:06:54,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:06:54,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,488 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:06:54,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:06:54,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:06:54,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:06:54,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:06:54,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:54,537 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-20 04:06:54,539 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-20 04:06:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:06:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:06:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:06:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:06:54,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:06:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:06:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:06:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:06:54,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:06:54,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:06:54,612 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:06:54,613 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:06:54,711 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:06:54,726 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:06:54,726 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-20 04:06:54,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:06:54 BoogieIcfgContainer [2022-03-20 04:06:54,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:06:54,728 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:06:54,728 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:06:54,731 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:06:54,733 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:06:54" (1/1) ... [2022-03-20 04:06:54,734 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:06:54,927 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-20 04:06:54,928 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_8 (+ v_main_~y~0_9 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~y~0_9 v_main_~y~0_8) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~x~0_7 v_main_~x~0_6)) (and (< 0 .cse0) (= v_main_~x~0_6 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_7 v_main_~y~0_9)) (< v_main_~y~0_9 v_main_~y~0_8) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_9 v_it_1 1) v_main_~y~0_8))))))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_7, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_6, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-03-20 04:06:55,074 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-20 04:06:55,075 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_8 (+ v_main_~z~0_7 1)) (< 0 (mod v_main_~z~0_8 4294967296)) (= v_main_~x~0_11 (+ v_main_~x~0_12 1))) InVars {main_~x~0=v_main_~x~0_12, main_~z~0=v_main_~z~0_8} OutVars{main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_7, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_8 4294967296))) (or (and (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_8 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_7 v_it_2 1) v_main_~z~0_8)) (not (<= 1 v_it_2)))) (= v_main_~x~0_11 (+ v_main_~x~0_12 v_main_~z~0_8 (* (- 1) v_main_~z~0_7))) (< 0 .cse0) (< v_main_~z~0_7 v_main_~z~0_8)) (and (<= .cse0 0) (= v_main_~z~0_8 v_main_~z~0_7) (= v_main_~x~0_12 v_main_~x~0_11) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)))) InVars {main_~x~0=v_main_~x~0_12, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_8, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_11, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-03-20 04:06:55,157 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-20 04:06:55,157 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_4, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|) (<= .cse0 0)) (and (= v_main_~y~0_4 (+ v_main_~y~0_5 v_main_~z~0_3 (* (- 1) v_main_~z~0_2))) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= (+ v_main_~z~0_3 v_it_3 1) v_main_~z~0_2)) (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_5 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-03-20 04:06:55,259 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-20 04:06:55,259 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~x~0_10 4294967296)) (= v_main_~x~0_10 (+ v_main_~x~0_9 1)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_9, main_~y~0=v_main_~y~0_10, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~x~0_10 v_main_~x~0_9)) (and (= (+ v_main_~x~0_10 v_main_~y~0_11 (* (- 1) v_main_~x~0_9)) v_main_~y~0_10) (< 0 .cse0) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_10) 4294967296)) (not (<= (+ v_main_~x~0_9 v_it_4 1) v_main_~x~0_10)) (not (<= 1 v_it_4)))) (< v_main_~x~0_9 v_main_~x~0_10)))) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_10, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_9, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-03-20 04:06:55,344 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-20 04:06:55,344 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296)) (= v_main_~x~0_13 (+ v_main_~x~0_14 1))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= v_main_~x~0_14 v_main_~x~0_13) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)) (and (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~z~0_9 v_it_5 1) v_main_~z~0_10)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (< v_main_~z~0_9 v_main_~z~0_10) (= v_main_~x~0_13 (+ v_main_~x~0_14 v_main_~z~0_10 (* (- 1) v_main_~z~0_9)))))) InVars {main_~x~0=v_main_~x~0_14, main_~z~0=v_main_~z~0_10, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_13, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-03-20 04:06:55,414 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-20 04:06:55,415 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~x~0_3 (+ v_main_~x~0_2 1))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_7} OutVars{main_~x~0=v_main_~x~0_2, main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post15, main_#t~post16, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_7 4294967296))) (or (and (= |v_main_#t~post15_3| |v_main_#t~post15_1|) (= |v_main_#t~post16_3| |v_main_#t~post16_1|) (= v_main_~y~0_7 v_main_~y~0_6) (= v_main_~x~0_3 v_main_~x~0_2) (<= .cse0 0)) (and (< 0 .cse0) (= v_main_~y~0_6 (+ v_main_~x~0_2 v_main_~y~0_7 (* (- 1) v_main_~x~0_3))) (forall ((v_it_6 Int)) (or (not (<= (+ v_main_~x~0_2 v_it_6 1) v_main_~x~0_3)) (not (<= 1 v_it_6)) (< 0 (mod (+ v_main_~y~0_7 (* v_it_6 4294967295)) 4294967296)))) (< v_main_~x~0_2 v_main_~x~0_3)))) InVars {main_#t~post15=|v_main_#t~post15_3|, main_~y~0=v_main_~y~0_7, main_#t~post16=|v_main_#t~post16_3|, main_~x~0=v_main_~x~0_3} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[main_~x~0, main_#t~post15, main_#t~post16, main_~y~0] [2022-03-20 04:06:55,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:06:55 BasicIcfg [2022-03-20 04:06:55,418 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:06:55,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:06:55,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:06:55,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:06:55,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:06:54" (1/4) ... [2022-03-20 04:06:55,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2926cc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:06:55, skipping insertion in model container [2022-03-20 04:06:55,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:06:54" (2/4) ... [2022-03-20 04:06:55,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2926cc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:06:55, skipping insertion in model container [2022-03-20 04:06:55,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:06:54" (3/4) ... [2022-03-20 04:06:55,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2926cc69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:06:55, skipping insertion in model container [2022-03-20 04:06:55,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:06:55" (4/4) ... [2022-03-20 04:06:55,425 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de62.cJordan [2022-03-20 04:06:55,429 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:06:55,429 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:06:55,458 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:06:55,463 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-20 04:06:55,463 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:06:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 04:06:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:06:55,477 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:55,477 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:55,477 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:55,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:55,481 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-03-20 04:06:55,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:55,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334376167] [2022-03-20 04:06:55,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:55,612 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-20 04:06:55,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:55,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334376167] [2022-03-20 04:06:55,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334376167] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:55,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:06:55,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:06:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194195071] [2022-03-20 04:06:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:55,621 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:06:55,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:55,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:06:55,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:06:55,650 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:55,677 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-03-20 04:06:55,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:06:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 04:06:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:55,684 INFO L225 Difference]: With dead ends: 25 [2022-03-20 04:06:55,684 INFO L226 Difference]: Without dead ends: 18 [2022-03-20 04:06:55,686 INFO L912 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-20 04:06:55,689 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:55,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:06:55,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-20 04:06:55,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-20 04:06:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-03-20 04:06:55,713 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-03-20 04:06:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:55,713 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-03-20 04:06:55,713 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:55,714 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-03-20 04:06:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:06:55,714 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:55,714 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:55,714 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:06:55,715 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:55,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:55,718 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-03-20 04:06:55,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:55,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421255102] [2022-03-20 04:06:55,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:55,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:55,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:55,837 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-20 04:06:55,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:55,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421255102] [2022-03-20 04:06:55,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421255102] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:55,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:06:55,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 04:06:55,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936525498] [2022-03-20 04:06:55,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:55,839 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 04:06:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:55,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 04:06:55,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 04:06:55,839 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:55,917 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-03-20 04:06:55,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 04:06:55,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 04:06:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:55,919 INFO L225 Difference]: With dead ends: 28 [2022-03-20 04:06:55,920 INFO L226 Difference]: Without dead ends: 25 [2022-03-20 04:06:55,921 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-20 04:06:55,923 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:55,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 37 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-03-20 04:06:55,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-20 04:06:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-03-20 04:06:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:55,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 26 transitions. [2022-03-20 04:06:55,934 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 26 transitions. Word has length 17 [2022-03-20 04:06:55,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:55,935 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 26 transitions. [2022-03-20 04:06:55,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 26 transitions. [2022-03-20 04:06:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:06:55,936 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:55,936 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:55,936 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:06:55,936 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:55,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-03-20 04:06:55,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:55,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453468619] [2022-03-20 04:06:55,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:55,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:55,953 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:55,976 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:56,022 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-20 04:06:56,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:56,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453468619] [2022-03-20 04:06:56,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453468619] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:56,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203903451] [2022-03-20 04:06:56,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:56,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:56,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:56,025 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-20 04:06:56,026 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-20 04:06:56,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:56,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 04:06:56,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:56,237 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-20 04:06:56,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:07:00,726 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-20 04:07:00,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203903451] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:07:00,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:07:00,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-03-20 04:07:00,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775954934] [2022-03-20 04:07:00,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:07:00,727 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 04:07:00,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:07:00,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 04:07:00,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=67, Unknown=2, NotChecked=0, Total=90 [2022-03-20 04:07:00,728 INFO L87 Difference]: Start difference. First operand 20 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:07:00,809 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-03-20 04:07:00,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:07:00,809 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-20 04:07:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:07:00,810 INFO L225 Difference]: With dead ends: 31 [2022-03-20 04:07:00,811 INFO L226 Difference]: Without dead ends: 28 [2022-03-20 04:07:00,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=45, Invalid=135, Unknown=2, NotChecked=0, Total=182 [2022-03-20 04:07:00,812 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:07:00,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-03-20 04:07:00,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-03-20 04:07:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-03-20 04:07:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-20 04:07:00,815 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-03-20 04:07:00,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:07:00,815 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-20 04:07:00,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:00,815 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-20 04:07:00,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:07:00,816 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:07:00,816 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:07:00,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 04:07:01,031 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-20 04:07:01,032 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:07:01,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:07:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-03-20 04:07:01,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:07:01,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831205642] [2022-03-20 04:07:01,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:01,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:07:01,039 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-20 04:07:01,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:01,064 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-20 04:07:01,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:07:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:01,110 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-20 04:07:01,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:07:01,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831205642] [2022-03-20 04:07:01,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831205642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:07:01,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621934278] [2022-03-20 04:07:01,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:01,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:07:01,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:07:01,112 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-20 04:07:01,118 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-20 04:07:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:01,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 04:07:01,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:07:01,269 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-20 04:07:01,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:07:01,779 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-20 04:07:01,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621934278] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:07:01,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:07:01,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2022-03-20 04:07:01,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037750737] [2022-03-20 04:07:01,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:07:01,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 04:07:01,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:07:01,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 04:07:01,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-03-20 04:07:01,780 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:01,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:07:01,851 INFO L93 Difference]: Finished difference Result 38 states and 55 transitions. [2022-03-20 04:07:01,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:07:01,851 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-20 04:07:01,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:07:01,852 INFO L225 Difference]: With dead ends: 38 [2022-03-20 04:07:01,852 INFO L226 Difference]: Without dead ends: 35 [2022-03-20 04:07:01,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:07:01,852 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:07:01,853 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 45 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-03-20 04:07:01,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-20 04:07:01,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-03-20 04:07:01,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.608695652173913) internal successors, (37), 23 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:01,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 41 transitions. [2022-03-20 04:07:01,856 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 41 transitions. Word has length 18 [2022-03-20 04:07:01,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:07:01,856 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 41 transitions. [2022-03-20 04:07:01,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:01,856 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 41 transitions. [2022-03-20 04:07:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:07:01,856 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:07:01,856 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:07:01,875 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-20 04:07:02,073 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-20 04:07:02,073 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:07:02,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:07:02,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-03-20 04:07:02,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:07:02,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304889870] [2022-03-20 04:07:02,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:02,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:07:02,081 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-20 04:07:02,098 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-20 04:07:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:02,125 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-20 04:07:02,129 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-20 04:07:02,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:07:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:02,221 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-20 04:07:02,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:07:02,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304889870] [2022-03-20 04:07:02,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304889870] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:07:02,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032261391] [2022-03-20 04:07:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:02,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:07:02,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:07:02,224 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-20 04:07:02,225 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-20 04:07:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:02,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 04:07:02,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:07:02,335 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-20 04:07:02,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:07:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:07:28,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032261391] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:07:28,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:07:28,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 16 [2022-03-20 04:07:28,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405169945] [2022-03-20 04:07:28,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:07:28,776 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 04:07:28,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:07:28,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 04:07:28,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=183, Unknown=9, NotChecked=0, Total=240 [2022-03-20 04:07:28,777 INFO L87 Difference]: Start difference. First operand 28 states and 41 transitions. Second operand has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:56,046 WARN L232 SmtUtils]: Spent 6.35s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:08:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:08:24,743 INFO L93 Difference]: Finished difference Result 59 states and 91 transitions. [2022-03-20 04:08:24,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 04:08:24,744 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 04:08:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:08:24,745 INFO L225 Difference]: With dead ends: 59 [2022-03-20 04:08:24,745 INFO L226 Difference]: Without dead ends: 55 [2022-03-20 04:08:24,745 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 79.4s TimeCoverageRelationStatistics Valid=138, Invalid=535, Unknown=29, NotChecked=0, Total=702 [2022-03-20 04:08:24,746 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:08:24,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 73 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-03-20 04:08:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-20 04:08:24,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2022-03-20 04:08:24,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.6875) internal successors, (54), 32 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:24,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 58 transitions. [2022-03-20 04:08:24,750 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 58 transitions. Word has length 19 [2022-03-20 04:08:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:08:24,751 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 58 transitions. [2022-03-20 04:08:24,751 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.75) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 58 transitions. [2022-03-20 04:08:24,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:08:24,751 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:08:24,751 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:08:24,769 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-03-20 04:08:24,967 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-20 04:08:24,968 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:08:24,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:08:24,968 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-03-20 04:08:24,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:08:24,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887920564] [2022-03-20 04:08:24,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:08:24,977 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:24,978 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:24,997 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:25,000 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:25,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:08:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 04:08:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:08:25,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887920564] [2022-03-20 04:08:25,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887920564] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:08:25,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:08:25,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 04:08:25,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777045935] [2022-03-20 04:08:25,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:08:25,101 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:08:25,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:08:25,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:08:25,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:08:25,102 INFO L87 Difference]: Start difference. First operand 37 states and 58 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:08:25,209 INFO L93 Difference]: Finished difference Result 52 states and 80 transitions. [2022-03-20 04:08:25,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:08:25,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 04:08:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:08:25,210 INFO L225 Difference]: With dead ends: 52 [2022-03-20 04:08:25,210 INFO L226 Difference]: Without dead ends: 46 [2022-03-20 04:08:25,210 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:08:25,211 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:08:25,211 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 47 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-03-20 04:08:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-20 04:08:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-03-20 04:08:25,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 34 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:25,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2022-03-20 04:08:25,214 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 19 [2022-03-20 04:08:25,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:08:25,214 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2022-03-20 04:08:25,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:25,214 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2022-03-20 04:08:25,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:08:25,215 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:08:25,215 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:08:25,215 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 04:08:25,215 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:08:25,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:08:25,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-03-20 04:08:25,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:08:25,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7184485] [2022-03-20 04:08:25,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:25,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:08:25,225 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-20 04:08:25,226 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:25,253 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:25,256 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:25,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:08:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:25,365 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-20 04:08:25,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:08:25,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7184485] [2022-03-20 04:08:25,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7184485] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:08:25,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432963331] [2022-03-20 04:08:25,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:25,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:08:25,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:08:25,367 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-20 04:08:25,368 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-20 04:08:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:25,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 04:08:25,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:08:25,586 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-20 04:08:25,587 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:08:51,647 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-20 04:08:51,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432963331] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:08:51,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:08:51,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 14 [2022-03-20 04:08:51,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441557095] [2022-03-20 04:08:51,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:08:51,648 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 04:08:51,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:08:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 04:08:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=136, Unknown=9, NotChecked=0, Total=182 [2022-03-20 04:08:51,649 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:51,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:08:51,967 INFO L93 Difference]: Finished difference Result 56 states and 86 transitions. [2022-03-20 04:08:51,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:08:51,967 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 04:08:51,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:08:51,968 INFO L225 Difference]: With dead ends: 56 [2022-03-20 04:08:51,968 INFO L226 Difference]: Without dead ends: 53 [2022-03-20 04:08:51,968 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 23.1s TimeCoverageRelationStatistics Valid=81, Invalid=290, Unknown=9, NotChecked=0, Total=380 [2022-03-20 04:08:51,969 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:08:51,969 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 56 Unchecked, 0.0s Time] [2022-03-20 04:08:51,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-20 04:08:51,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2022-03-20 04:08:51,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6944444444444444) internal successors, (61), 36 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:51,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2022-03-20 04:08:51,972 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 19 [2022-03-20 04:08:51,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:08:51,972 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2022-03-20 04:08:51,972 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 11 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2022-03-20 04:08:51,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:08:51,973 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:08:51,973 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:08:51,990 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-20 04:08:52,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:08:52,188 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:08:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:08:52,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-03-20 04:08:52,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:08:52,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914737563] [2022-03-20 04:08:52,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:08:52,193 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-20 04:08:52,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:52,222 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:08:52,224 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:08:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:52,288 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-20 04:08:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:08:52,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914737563] [2022-03-20 04:08:52,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914737563] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:08:52,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:08:52,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 04:08:52,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549564534] [2022-03-20 04:08:52,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:08:52,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:08:52,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:08:52,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:08:52,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:08:52,290 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:08:52,381 INFO L93 Difference]: Finished difference Result 57 states and 89 transitions. [2022-03-20 04:08:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:08:52,381 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 04:08:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:08:52,382 INFO L225 Difference]: With dead ends: 57 [2022-03-20 04:08:52,382 INFO L226 Difference]: Without dead ends: 52 [2022-03-20 04:08:52,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:08:52,383 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:08:52,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 47 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 69 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-20 04:08:52,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-20 04:08:52,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-03-20 04:08:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-03-20 04:08:52,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-03-20 04:08:52,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:08:52,387 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-03-20 04:08:52,387 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:52,387 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-03-20 04:08:52,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:08:52,387 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:08:52,388 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:08:52,388 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 04:08:52,388 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:08:52,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:08:52,388 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-03-20 04:08:52,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:08:52,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875044305] [2022-03-20 04:08:52,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:52,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:08:52,394 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-20 04:08:52,395 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-20 04:08:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:52,419 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:08:52,421 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:08:52,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:08:52,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:52,474 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-20 04:08:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:08:52,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875044305] [2022-03-20 04:08:52,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875044305] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:08:52,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928148346] [2022-03-20 04:08:52,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:52,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:08:52,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:08:52,492 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-20 04:08:52,527 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-20 04:08:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:52,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:08:52,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:08:52,697 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-20 04:08:52,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:09:00,322 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_28_31 Int) (v_main_~x~0_29 Int)) (or (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~x~0_28_31 Int)) (or (not (< v_main_~x~0_29 (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296)))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_29 v_it_5 1) (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296)))))))) (or (forall ((aux_div_v_main_~x~0_28_31 Int)) (not (= v_main_~x~0_29 (+ aux_mod_v_main_~x~0_28_31 (* aux_div_v_main_~x~0_28_31 4294967296))))) .cse0))) (<= 4294967296 aux_mod_v_main_~x~0_28_31) (<= aux_mod_v_main_~x~0_28_31 0) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse1) (not (< v_main_~x~0_29 c_main_~x~0)) (exists ((v_it_4 Int)) (and (<= (+ v_main_~x~0_29 v_it_4 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))) (or .cse1 (not (= v_main_~x~0_29 c_main_~x~0))))))) is different from true [2022-03-20 04:09:05,635 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-20 04:09:05,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928148346] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:09:05,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:09:05,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 8] total 12 [2022-03-20 04:09:05,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945020447] [2022-03-20 04:09:05,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:09:05,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 04:09:05,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:09:05,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 04:09:05,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=4, NotChecked=18, Total=132 [2022-03-20 04:09:05,638 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:05,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:09:05,770 INFO L93 Difference]: Finished difference Result 58 states and 92 transitions. [2022-03-20 04:09:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:09:05,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 04:09:05,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:09:05,772 INFO L225 Difference]: With dead ends: 58 [2022-03-20 04:09:05,772 INFO L226 Difference]: Without dead ends: 55 [2022-03-20 04:09:05,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=4, NotChecked=26, Total=240 [2022-03-20 04:09:05,773 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:09:05,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 58 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 60 Unchecked, 0.0s Time] [2022-03-20 04:09:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-03-20 04:09:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2022-03-20 04:09:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-20 04:09:05,777 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-03-20 04:09:05,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:09:05,777 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-20 04:09:05,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:05,777 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-20 04:09:05,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:09:05,778 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:09:05,778 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:09:05,797 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-20 04:09:05,978 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:05,979 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:09:05,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:09:05,979 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-03-20 04:09:05,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:09:05,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565969192] [2022-03-20 04:09:05,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:05,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:09:05,983 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-20 04:09:05,984 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:05,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:06,000 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:06,006 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:06,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:09:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:06,121 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-20 04:09:06,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:09:06,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565969192] [2022-03-20 04:09:06,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565969192] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:09:06,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557024334] [2022-03-20 04:09:06,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:06,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:06,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:09:06,135 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-20 04:09:06,136 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-20 04:09:06,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:06,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 04:09:06,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:09:06,301 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-20 04:09:06,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:09:09,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:09:09,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557024334] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:09:09,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:09:09,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-20 04:09:09,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806124025] [2022-03-20 04:09:09,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:09:09,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 04:09:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:09:09,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 04:09:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=144, Unknown=1, NotChecked=0, Total=182 [2022-03-20 04:09:09,036 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:09,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:09:09,186 INFO L93 Difference]: Finished difference Result 64 states and 101 transitions. [2022-03-20 04:09:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 04:09:09,187 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 04:09:09,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:09:09,187 INFO L225 Difference]: With dead ends: 64 [2022-03-20 04:09:09,187 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 04:09:09,188 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=101, Invalid=360, Unknown=1, NotChecked=0, Total=462 [2022-03-20 04:09:09,192 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:09:09,193 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 72 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 90 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-03-20 04:09:09,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 04:09:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2022-03-20 04:09:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-20 04:09:09,201 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-20 04:09:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:09:09,201 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-20 04:09:09,201 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-20 04:09:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:09:09,202 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:09:09,202 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:09:09,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 04:09:09,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:09,409 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:09:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:09:09,409 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-03-20 04:09:09,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:09:09,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403640395] [2022-03-20 04:09:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:09,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:09:09,422 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-20 04:09:09,424 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-20 04:09:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:09,436 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:09,439 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-20 04:09:09,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:09:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:09,528 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-20 04:09:09,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:09:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403640395] [2022-03-20 04:09:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403640395] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:09:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118624040] [2022-03-20 04:09:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:09,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:09,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:09:09,529 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-20 04:09:09,542 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-20 04:09:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:09,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-20 04:09:09,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:09:09,690 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-20 04:09:09,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:09:14,536 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-20 04:09:14,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118624040] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:09:14,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:09:14,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 14 [2022-03-20 04:09:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942678402] [2022-03-20 04:09:14,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:09:14,538 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 04:09:14,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:09:14,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 04:09:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=145, Unknown=1, NotChecked=0, Total=182 [2022-03-20 04:09:14,539 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:09:14,710 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-03-20 04:09:14,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 04:09:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-20 04:09:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:09:14,712 INFO L225 Difference]: With dead ends: 62 [2022-03-20 04:09:14,712 INFO L226 Difference]: Without dead ends: 59 [2022-03-20 04:09:14,713 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=93, Invalid=368, Unknown=1, NotChecked=0, Total=462 [2022-03-20 04:09:14,720 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:09:14,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 92 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-03-20 04:09:14,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-20 04:09:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 44. [2022-03-20 04:09:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:14,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-20 04:09:14,743 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-20 04:09:14,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:09:14,743 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-20 04:09:14,744 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:09:14,744 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-20 04:09:14,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:09:14,745 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:09:14,745 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:09:14,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 04:09:14,945 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:14,946 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:09:14,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:09:14,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1145856883, now seen corresponding path program 2 times [2022-03-20 04:09:14,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:09:14,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972696642] [2022-03-20 04:09:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:14,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:09:14,950 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-20 04:09:14,951 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:14,952 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:14,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:14,977 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:14,979 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:14,981 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:15,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:09:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:09:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:09:15,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972696642] [2022-03-20 04:09:15,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972696642] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:09:15,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272351962] [2022-03-20 04:09:15,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:09:15,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:15,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:09:15,124 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-20 04:09:15,125 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-20 04:09:15,162 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:09:15,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:09:15,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:09:15,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:09:15,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:09:15,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:09:48,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) is different from false [2022-03-20 04:09:50,193 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) is different from true [2022-03-20 04:10:22,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-20 04:10:22,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272351962] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:10:22,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:10:22,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-20 04:10:22,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840143087] [2022-03-20 04:10:22,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:10:22,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 04:10:22,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:10:22,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 04:10:22,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=181, Unknown=14, NotChecked=28, Total=272 [2022-03-20 04:10:22,787 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:10:35,217 WARN L232 SmtUtils]: Spent 8.18s on a formula simplification that was a NOOP. DAG size: 109 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:10:37,230 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (let ((.cse0 (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse0) (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (not .cse0)))) (< 0 aux_mod_v_main_~y~0_26_31)))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))) .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (or (< 0 (mod c_main_~z~0 4294967296)) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (<= aux_mod_v_main_~x~0_35_31 0) (let ((.cse3 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse3 (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (or (not .cse3) (and (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_26_31) (* v_it_5 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (< aux_mod_v_main_~y~0_26_31 0) (< 0 aux_mod_v_main_~y~0_26_31))) (forall ((aux_mod_v_main_~y~0_26_31 Int) (aux_div_v_main_~y~0_26_31 Int)) (or (<= c_main_~y~0 (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~y~0_26_31)) (<= aux_mod_v_main_~y~0_26_31 0) (<= 4294967296 aux_mod_v_main_~y~0_26_31) (and (or (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))))) (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0)))) (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_26_31 4294967296) aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31) aux_mod_v_main_~y~0_26_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) aux_mod_v_main_~y~0_26_31) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))) (exists ((v_it_3 Int)) (and (<= (+ (* aux_div_v_main_~y~0_26_31 4294967296) v_it_3 aux_mod_v_main_~y~0_26_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-20 04:10:39,254 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~x~0_35_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_35_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296))) (.cse0 (forall ((aux_div_v_main_~x~0_35_31 Int)) (not (= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0))))) (and (or (and (forall ((aux_div_v_main_~x~0_35_31 Int) (aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (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) (+ aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31))))) (<= 4294967296 aux_mod_v_main_~z~0_32_31) (<= (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~z~0_32_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_32_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (<= (+ aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31)) c_main_~z~0))) (or .cse0 (forall ((aux_mod_v_main_~z~0_32_31 Int) (aux_div_v_main_~z~0_32_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31))))) (< aux_mod_v_main_~z~0_32_31 0) (< 0 aux_mod_v_main_~z~0_32_31) (<= (+ aux_mod_v_main_~z~0_32_31 (* 4294967296 aux_div_v_main_~z~0_32_31)) c_main_~z~0))))) (not .cse1)) (or .cse1 (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or .cse0 .cse2) (or (not .cse2) (forall ((aux_div_v_main_~x~0_35_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296))))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_35_31 (* aux_div_v_main_~x~0_35_31 4294967296)))))))))))) (<= aux_mod_v_main_~x~0_35_31 0))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-20 04:10:54,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:10:54,016 INFO L93 Difference]: Finished difference Result 67 states and 107 transitions. [2022-03-20 04:10:54,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 04:10:54,016 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 14 states have internal predecessors, (28), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:10:54,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:10:54,017 INFO L225 Difference]: With dead ends: 67 [2022-03-20 04:10:54,017 INFO L226 Difference]: Without dead ends: 64 [2022-03-20 04:10:54,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=123, Invalid=464, Unknown=25, NotChecked=144, Total=756 [2022-03-20 04:10:54,018 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 43 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:10:54,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 77 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 122 Unchecked, 0.1s Time] [2022-03-20 04:10:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-20 04:10:54,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 46. [2022-03-20 04:10:54,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:10:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2022-03-20 04:10:54,020 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 20 [2022-03-20 04:10:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:10:54,020 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2022-03-20 04:10:54,020 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), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:10:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2022-03-20 04:10:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:10:54,021 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:10:54,021 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:10:54,053 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-20 04:10:54,221 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,SelfDestructingSolverStorable11 [2022-03-20 04:10:54,222 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:10:54,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:10:54,222 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 1 times [2022-03-20 04:10:54,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:10:54,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234745865] [2022-03-20 04:10:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:10:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:10:54,226 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-20 04:10:54,227 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:54,228 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:54,244 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:54,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:54,248 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:10:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:10:54,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:10:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234745865] [2022-03-20 04:10:54,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234745865] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:10:54,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200588968] [2022-03-20 04:10:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:10:54,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:10:54,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:10:54,336 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-20 04:10:54,337 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-20 04:10:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:54,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:10:54,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:10:54,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:10:54,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:11:00,096 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_38_31 Int)) (or (<= aux_mod_v_main_~x~0_38_31 0) (<= 4294967296 aux_mod_v_main_~x~0_38_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((aux_div_v_main_~x~0_38_31 Int) (aux_div_v_main_~y~0_30_31 Int) (aux_mod_v_main_~y~0_30_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_30_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296) v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_30_31 4294967296) aux_mod_v_main_~y~0_30_31 c_main_~x~0)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_30_31 (* v_it_6 4294967295)) 4294967296))))) (exists ((v_it_6 Int)) (and (<= (+ (* aux_div_v_main_~y~0_30_31 4294967296) v_it_6 aux_mod_v_main_~y~0_30_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse0 aux_mod_v_main_~y~0_30_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296) c_main_~y~0)) (<= aux_mod_v_main_~y~0_30_31 0) (<= c_main_~y~0 (+ .cse0 aux_mod_v_main_~y~0_30_31)) (<= 4294967296 aux_mod_v_main_~y~0_30_31)))) (or (< 0 (mod (+ aux_mod_v_main_~x~0_38_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~x~0_38_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296) v_it_6 1) c_main_~x~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))))) (not .cse1)) (or .cse1 (forall ((aux_div_v_main_~x~0_38_31 Int)) (not (= (+ aux_mod_v_main_~x~0_38_31 (* aux_div_v_main_~x~0_38_31 4294967296)) c_main_~x~0)))))))) is different from false [2022-03-20 04:11:01,674 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-20 04:11:01,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1200588968] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:11:01,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:11:01,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 7] total 13 [2022-03-20 04:11:01,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759510928] [2022-03-20 04:11:01,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:11:01,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 04:11:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:11:01,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 04:11:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=103, Unknown=2, NotChecked=20, Total=156 [2022-03-20 04:11:01,675 INFO L87 Difference]: Start difference. First operand 46 states and 74 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:11:08,482 WARN L232 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 78 DAG size of output: 75 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:11:08,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:11:08,539 INFO L93 Difference]: Finished difference Result 71 states and 112 transitions. [2022-03-20 04:11:08,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 04:11:08,539 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:11:08,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:11:08,540 INFO L225 Difference]: With dead ends: 71 [2022-03-20 04:11:08,540 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 04:11:08,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=80, Invalid=264, Unknown=2, NotChecked=34, Total=380 [2022-03-20 04:11:08,540 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:11:08,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 60 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 73 Invalid, 0 Unknown, 44 Unchecked, 0.0s Time] [2022-03-20 04:11:08,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 04:11:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-03-20 04:11:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 47 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:11:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 83 transitions. [2022-03-20 04:11:08,543 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 83 transitions. Word has length 20 [2022-03-20 04:11:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:11:08,543 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 83 transitions. [2022-03-20 04:11:08,543 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 10 states have internal predecessors, (34), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:11:08,543 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 83 transitions. [2022-03-20 04:11:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:11:08,544 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:11:08,544 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:11:08,567 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-20 04:11:08,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-20 04:11:08,751 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:11:08,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:11:08,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-03-20 04:11:08,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:11:08,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991588521] [2022-03-20 04:11:08,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:11:08,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:11:08,756 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-20 04:11:08,757 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-20 04:11:08,757 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:08,787 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:08,790 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:08,792 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:08,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:11:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:08,906 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-20 04:11:08,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:11:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991588521] [2022-03-20 04:11:08,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991588521] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:11:08,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652690748] [2022-03-20 04:11:08,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:11:08,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:11:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:11:08,907 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-20 04:11:08,914 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-20 04:11:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:08,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:11:08,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:11:09,059 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-20 04:11:09,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:12:33,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:12:33,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652690748] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:12:33,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:12:33,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 11] total 20 [2022-03-20 04:12:33,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420820865] [2022-03-20 04:12:33,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:12:33,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 04:12:33,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:12:33,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 04:12:33,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=278, Unknown=28, NotChecked=0, Total=380 [2022-03-20 04:12:33,250 INFO L87 Difference]: Start difference. First operand 52 states and 83 transitions. Second operand has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:12:53,720 WARN L232 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:13:16,697 WARN L232 SmtUtils]: Spent 16.35s on a formula simplification that was a NOOP. DAG size: 122 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:14:29,760 WARN L232 SmtUtils]: Spent 46.10s on a formula simplification. DAG size of input: 168 DAG size of output: 155 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:15:02,262 WARN L232 SmtUtils]: Spent 14.92s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:15:56,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:56,694 INFO L93 Difference]: Finished difference Result 75 states and 115 transitions. [2022-03-20 04:15:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-20 04:15:56,695 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:15:56,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:56,695 INFO L225 Difference]: With dead ends: 75 [2022-03-20 04:15:56,695 INFO L226 Difference]: Without dead ends: 71 [2022-03-20 04:15:56,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 272.5s TimeCoverageRelationStatistics Valid=191, Invalid=787, Unknown=78, NotChecked=0, Total=1056 [2022-03-20 04:15:56,696 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 54 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 108 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:56,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 94 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 100 Invalid, 0 Unknown, 108 Unchecked, 0.1s Time] [2022-03-20 04:15:56,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-03-20 04:15:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-03-20 04:15:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:15:56,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-03-20 04:15:56,698 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 20 [2022-03-20 04:15:56,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:56,698 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-03-20 04:15:56,699 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.75) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:15:56,699 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-03-20 04:15:56,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:15:56,699 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:56,699 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:56,719 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-20 04:15:56,899 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,SelfDestructingSolverStorable13 [2022-03-20 04:15:56,900 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:56,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:56,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-03-20 04:15:56,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:56,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15269665] [2022-03-20 04:15:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:56,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:56,904 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-20 04:15:56,904 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-20 04:15:56,905 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-20 04:15:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:56,920 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:15:56,922 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:15:56,924 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-20 04:15:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 04:15:57,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:57,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15269665] [2022-03-20 04:15:57,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15269665] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:15:57,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:15:57,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 04:15:57,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823557740] [2022-03-20 04:15:57,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:15:57,005 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:15:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:15:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:15:57,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:15:57,005 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:15:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:15:57,113 INFO L93 Difference]: Finished difference Result 62 states and 96 transitions. [2022-03-20 04:15:57,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:15:57,113 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:15:57,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:15:57,114 INFO L225 Difference]: With dead ends: 62 [2022-03-20 04:15:57,114 INFO L226 Difference]: Without dead ends: 57 [2022-03-20 04:15:57,114 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:15:57,114 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:15:57,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 44 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 51 Invalid, 0 Unknown, 10 Unchecked, 0.1s Time] [2022-03-20 04:15:57,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-03-20 04:15:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-03-20 04:15:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 46 states have internal predecessors, (78), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:15:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 82 transitions. [2022-03-20 04:15:57,116 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 82 transitions. Word has length 20 [2022-03-20 04:15:57,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:15:57,117 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 82 transitions. [2022-03-20 04:15:57,117 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:15:57,117 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 82 transitions. [2022-03-20 04:15:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:15:57,117 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:15:57,117 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:15:57,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 04:15:57,117 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:15:57,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:15:57,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-03-20 04:15:57,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:15:57,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071074718] [2022-03-20 04:15:57,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:57,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:15:57,121 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-20 04:15:57,122 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-20 04:15:57,122 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:15:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:57,131 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.6))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:15:57,132 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:15:57,133 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:15:57,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:15:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:57,232 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-20 04:15:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:15:57,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071074718] [2022-03-20 04:15:57,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071074718] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:15:57,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141843378] [2022-03-20 04:15:57,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:15:57,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:15:57,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:15:57,242 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-20 04:15:57,270 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-20 04:15:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:15:57,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:15:57,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:15:57,428 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-20 04:15:57,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:16:32,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse2) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))))) is different from false [2022-03-20 04:16:39,172 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (not (< 0 (mod c_main_~y~0 4294967296))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-03-20 04:16:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-20 04:16:43,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141843378] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:16:43,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:16:43,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2022-03-20 04:16:43,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477877416] [2022-03-20 04:16:43,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:16:43,597 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 04:16:43,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:16:43,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 04:16:43,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=163, Unknown=7, NotChecked=54, Total=272 [2022-03-20 04:16:43,604 INFO L87 Difference]: Start difference. First operand 51 states and 82 transitions. Second operand has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:16:54,043 WARN L232 SmtUtils]: Spent 10.11s on a formula simplification that was a NOOP. DAG size: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:16:56,051 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (= |c_#NULL.offset| |c_old(#NULL.offset)|) (forall ((aux_mod_v_main_~x~0_46_31 Int) (v_main_~x~0_47 Int)) (or (<= aux_mod_v_main_~x~0_46_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~x~0_47 c_main_~x~0))) (or (not .cse0) (not (< v_main_~x~0_47 c_main_~x~0)) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~x~0_47 v_it_4 1) c_main_~x~0) (<= 1 v_it_4)))))) (<= 4294967296 aux_mod_v_main_~x~0_46_31) (and (forall ((aux_div_v_main_~x~0_46_31 Int) (aux_mod_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_main_~x~0_47 v_it_5 1) (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))) (<= 1 v_it_5))) (<= (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296)) v_main_~x~0_47) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse1) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))))) (or (forall ((aux_div_v_main_~x~0_46_31 Int)) (not (= v_main_~x~0_47 (+ aux_mod_v_main_~x~0_46_31 (* aux_div_v_main_~x~0_46_31 4294967296))))) (forall ((aux_mod_v_main_~z~0_45_31 Int)) (or (< 0 aux_mod_v_main_~z~0_45_31) (let ((.cse2 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse2 (forall ((aux_div_v_main_~z~0_45_31 Int)) (not (= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0)))) (or (not .cse2) (forall ((aux_div_v_main_~z~0_45_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)))) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3)))))))) (< aux_mod_v_main_~z~0_45_31 0)))))))) is different from false [2022-03-20 04:17:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:17:08,670 INFO L93 Difference]: Finished difference Result 70 states and 109 transitions. [2022-03-20 04:17:08,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-20 04:17:08,670 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:17:08,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:17:08,671 INFO L225 Difference]: With dead ends: 70 [2022-03-20 04:17:08,671 INFO L226 Difference]: Without dead ends: 67 [2022-03-20 04:17:08,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 44.2s TimeCoverageRelationStatistics Valid=125, Invalid=474, Unknown=13, NotChecked=144, Total=756 [2022-03-20 04:17:08,671 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 54 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:17:08,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 64 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 52 Invalid, 0 Unknown, 120 Unchecked, 0.1s Time] [2022-03-20 04:17:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-03-20 04:17:08,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 49. [2022-03-20 04:17:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.6818181818181819) internal successors, (74), 44 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:17:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2022-03-20 04:17:08,673 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 20 [2022-03-20 04:17:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:17:08,673 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2022-03-20 04:17:08,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 14 states have internal predecessors, (31), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:17:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2022-03-20 04:17:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:17:08,674 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:17:08,674 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:17:08,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-20 04:17:08,875 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,SelfDestructingSolverStorable15 [2022-03-20 04:17:08,875 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:17:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:17:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-03-20 04:17:08,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:17:08,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097987416] [2022-03-20 04:17:08,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:17:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:17:08,881 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-20 04:17:08,882 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:17:08,895 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-20 04:17:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:17:08,934 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:17:08,936 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.7))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:17:08,937 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.8))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-20 04:17:09,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:17:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:17:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:17:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:17:09,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097987416] [2022-03-20 04:17:09,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097987416] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:17:09,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2016075942] [2022-03-20 04:17:09,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:17:09,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:17:09,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:17:09,054 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-20 04:17:09,056 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-20 04:17:09,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:17:09,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:17:09,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:17:09,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:17:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:17:09,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:17:17,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_51_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_51_31) (<= aux_mod_v_main_~x~0_51_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (and (or (< 0 (mod (+ aux_mod_v_main_~x~0_51_31 (* 4294967295 c_main_~x~0) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~x~0_51_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 (* aux_div_v_main_~x~0_51_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~x~0_51_31 Int) (aux_mod_v_main_~y~0_43_31 Int) (aux_div_v_main_~y~0_43_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_43_31 4294967296))) (or (<= aux_mod_v_main_~y~0_43_31 0) (<= (+ .cse1 aux_mod_v_main_~y~0_43_31 c_main_~x~0) (+ aux_mod_v_main_~x~0_51_31 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_43_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_43_31) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 c_main_~x~0)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_31 (* v_it_6 4294967295)) 4294967296)))))))))) (or .cse0 (forall ((aux_div_v_main_~x~0_51_31 Int)) (not (= (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) c_main_~x~0)))))))) is different from false [2022-03-20 04:17:35,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_51_31 Int) (v_main_~x~0_53 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_51_31) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_51_31 Int)) (not (= (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) v_main_~x~0_53)))) (or (not .cse0) (and (forall ((aux_div_v_main_~x~0_51_31 Int) (aux_mod_v_main_~y~0_43_31 Int) (aux_div_v_main_~y~0_43_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_43_31 4294967296))) (or (<= aux_mod_v_main_~y~0_43_31 0) (<= (+ v_main_~x~0_53 .cse1 aux_mod_v_main_~y~0_43_31) (+ aux_mod_v_main_~x~0_51_31 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 c_main_~y~0 (* aux_div_v_main_~x~0_51_31 4294967296) 1) (+ v_main_~x~0_53 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31)))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_43_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_43_31 4294967296) aux_mod_v_main_~y~0_43_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_43_31)))) (or (forall ((aux_div_v_main_~x~0_51_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_51_31 (* aux_div_v_main_~x~0_51_31 4294967296)) v_main_~x~0_53)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_51_31 v_it_6 (* aux_div_v_main_~x~0_51_31 4294967296) 1) v_main_~x~0_53) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ aux_mod_v_main_~x~0_51_31 (* v_main_~x~0_53 4294967295) c_main_~y~0) 4294967296))))))) (<= aux_mod_v_main_~x~0_51_31 0) (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_53 c_main_~x~0)) .cse2) (or (not .cse2) (not (< c_main_~x~0 v_main_~x~0_53)) (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_53) (<= 1 v_it_5)))))))) is different from false [2022-03-20 04:17:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-20 04:17:49,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2016075942] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:17:49,281 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:17:49,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2022-03-20 04:17:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435415781] [2022-03-20 04:17:49,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:17:49,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 04:17:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:17:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 04:17:49,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=187, Unknown=5, NotChecked=58, Total=306 [2022-03-20 04:17:49,282 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:18:00,695 WARN L232 SmtUtils]: Spent 11.26s on a formula simplification. DAG size of input: 101 DAG size of output: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:18:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:18:02,254 INFO L93 Difference]: Finished difference Result 71 states and 108 transitions. [2022-03-20 04:18:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 04:18:02,254 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:18:02,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:18:02,255 INFO L225 Difference]: With dead ends: 71 [2022-03-20 04:18:02,255 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 04:18:02,255 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=132, Invalid=471, Unknown=5, NotChecked=94, Total=702 [2022-03-20 04:18:02,256 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:18:02,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 72 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 74 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2022-03-20 04:18:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 04:18:02,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-03-20 04:18:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:18:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 84 transitions. [2022-03-20 04:18:02,257 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 84 transitions. Word has length 20 [2022-03-20 04:18:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:18:02,258 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 84 transitions. [2022-03-20 04:18:02,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:18:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 84 transitions. [2022-03-20 04:18:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:18:02,258 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:18:02,258 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:18:02,276 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-20 04:18:02,458 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,SelfDestructingSolverStorable16 [2022-03-20 04:18:02,459 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:18:02,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:18:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1165808695, now seen corresponding path program 1 times [2022-03-20 04:18:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:18:02,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817078101] [2022-03-20 04:18:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:18:02,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:18:02,462 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-20 04:18:02,463 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-20 04:18:02,466 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:18:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:18:02,474 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.8))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:18:02,476 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.9))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:18:02,477 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.10))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:18:02,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:18:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:18:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:18:02,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:18:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817078101] [2022-03-20 04:18:02,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817078101] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:18:02,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739936099] [2022-03-20 04:18:02,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:18:02,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:18:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:18:02,583 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-20 04:18:02,584 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-20 04:18:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:18:02,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:18:02,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:18:02,864 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-20 04:18:02,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:18:05,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)) c_main_~x~0)))) (or (not .cse0) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (not (< (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)) c_main_~x~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) c_main_~x~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))))) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from false [2022-03-20 04:19:02,463 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int)) (or (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_47_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ c_main_~x~0 c_main_~y~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) c_main_~y~0))) .cse0))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (forall ((aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not (= (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_47_31) 4294967296) 0)) .cse2 (let ((.cse3 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (= v_main_~x~0_58 c_main_~x~0)) .cse3) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_58) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not .cse3) (not (< c_main_~x~0 v_main_~x~0_58)))))) (or (not .cse2) (forall ((aux_div_v_main_~y~0_47_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (not (< c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_47_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)) (<= 1 v_it_4))) (let ((.cse7 (< 0 (mod c_main_~z~0 4294967296))) (.cse5 (+ c_main_~x~0 c_main_~y~0)) (.cse6 (+ v_main_~x~0_58 .cse4 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse5 .cse6)) .cse7) (or (not .cse7) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 c_main_~y~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< .cse5 .cse6))))))))))) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296)))))))) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from false [2022-03-20 04:20:04,938 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int) (aux_mod_main_~y~0_26 Int)) (or (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31) (and (forall ((aux_mod_v_main_~y~0_47_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296)))))) (not (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26))))) .cse0) (or (not .cse0) (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse1) (forall ((aux_div_v_main_~x~0_57_31 Int)) (or (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296)))) (exists ((v_it_5 Int)) (and (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5)))))) (or (forall ((aux_div_v_main_~x~0_57_31 Int)) (not (= (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))))) .cse1))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))))))) (< aux_mod_v_main_~y~0_47_31 0) (< 0 aux_mod_v_main_~y~0_47_31))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_main_~y~0_26 Int) (aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int) (v_main_~x~0_58 Int)) (let ((.cse6 (* 4294967296 aux_div_main_~y~0_26)) (.cse5 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (let ((.cse4 (< 0 (mod c_main_~z~0 4294967296))) (.cse2 (+ aux_mod_main_~y~0_26 .cse6 c_main_~x~0)) (.cse3 (+ v_main_~x~0_58 .cse5 aux_mod_v_main_~y~0_47_31))) (and (or (not (= .cse2 .cse3)) .cse4) (or (not .cse4) (not (< .cse2 .cse3)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ aux_mod_main_~y~0_26 v_it_5 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0 1) (+ v_main_~x~0_58 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31))))))) (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (<= v_main_~x~0_58 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~x~0_57_31 4294967296) 1) v_main_~x~0_58) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296))))) (not (< (+ aux_mod_main_~y~0_26 .cse6) (+ .cse5 aux_mod_v_main_~y~0_47_31)))))))))) is different from true [2022-03-20 04:20:09,710 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_57_31 Int) (aux_mod_main_~y~0_26 Int)) (or (let ((.cse2 (not (< 0 (mod c_main_~x~0 4294967296))))) (and (or (forall ((aux_div_main_~y~0_26 Int) (aux_mod_v_main_~y~0_47_31 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~y~0_26)) (.cse1 (* aux_div_v_main_~y~0_47_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_47_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_6 (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296) 1) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0)))) (<= 4294967296 aux_mod_v_main_~y~0_47_31) (<= aux_mod_v_main_~y~0_47_31 0) (<= (+ aux_mod_main_~y~0_26 .cse0 c_main_~x~0) (+ aux_mod_v_main_~x~0_57_31 .cse1 aux_mod_v_main_~y~0_47_31 (* aux_div_v_main_~x~0_57_31 4294967296))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_47_31 4294967296) aux_mod_v_main_~y~0_47_31)))) (not (< (+ aux_mod_main_~y~0_26 .cse0) (+ .cse1 aux_mod_v_main_~y~0_47_31)))))) .cse2) (or (forall ((aux_div_main_~y~0_26 Int) (aux_div_v_main_~y~0_47_31 Int) (aux_div_v_main_~x~0_57_31 Int)) (let ((.cse3 (* aux_div_v_main_~x~0_57_31 4294967296))) (let ((.cse5 (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26) c_main_~x~0)) (.cse4 (+ aux_mod_v_main_~x~0_57_31 (* aux_div_v_main_~y~0_47_31 4294967296) .cse3))) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_57_31 v_it_4 (* aux_div_v_main_~x~0_57_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_4))) (not (< (+ aux_mod_v_main_~x~0_57_31 .cse3) c_main_~x~0)) (< .cse4 .cse5) (< .cse5 .cse4))))) .cse2))) (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (<= aux_mod_v_main_~x~0_57_31 0) (<= 4294967296 aux_mod_v_main_~x~0_57_31))) is different from true [2022-03-20 04:20:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-20 04:20:12,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739936099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:20:12,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:20:12,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 19 [2022-03-20 04:20:12,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584906989] [2022-03-20 04:20:12,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:20:12,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:20:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:20:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:20:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=161, Unknown=12, NotChecked=116, Total=342 [2022-03-20 04:20:12,672 INFO L87 Difference]: Start difference. First operand 53 states and 84 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:20:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:20:19,860 INFO L93 Difference]: Finished difference Result 74 states and 113 transitions. [2022-03-20 04:20:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 04:20:19,860 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:20:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:20:19,861 INFO L225 Difference]: With dead ends: 74 [2022-03-20 04:20:19,861 INFO L226 Difference]: Without dead ends: 68 [2022-03-20 04:20:19,861 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=124, Invalid=430, Unknown=14, NotChecked=188, Total=756 [2022-03-20 04:20:19,861 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 51 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:20:19,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 68 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 116 Unchecked, 0.1s Time] [2022-03-20 04:20:19,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-20 04:20:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 55. [2022-03-20 04:20:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.68) internal successors, (84), 50 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:20:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 88 transitions. [2022-03-20 04:20:19,863 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 88 transitions. Word has length 20 [2022-03-20 04:20:19,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:20:19,863 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 88 transitions. [2022-03-20 04:20:19,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:20:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 88 transitions. [2022-03-20 04:20:19,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:20:19,864 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:20:19,864 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:20:19,883 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-20 04:20:20,075 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,SelfDestructingSolverStorable17 [2022-03-20 04:20:20,076 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:20:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:20:20,076 INFO L85 PathProgramCache]: Analyzing trace with hash -392821618, now seen corresponding path program 2 times [2022-03-20 04:20:20,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:20:20,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372209573] [2022-03-20 04:20:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:20:20,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:20:20,079 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-20 04:20:20,080 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-20 04:20:20,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-03-20 04:20:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:20,087 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:20:20,088 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.7))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:20:20,089 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.8))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-03-20 04:20:20,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:20:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:20:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:20:20,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:20:20,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372209573] [2022-03-20 04:20:20,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372209573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:20:20,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669989725] [2022-03-20 04:20:20,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:20:20,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:20:20,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:20:20,253 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:20:20,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-20 04:20:20,291 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:20:20,291 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:20:20,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-20 04:20:20,294 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:20:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:20:20,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:20:22,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_63_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_63_31) (<= aux_mod_v_main_~x~0_63_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_63_31 Int)) (not (= (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) c_main_~x~0))) .cse0) (or (not .cse0) (forall ((aux_div_v_main_~x~0_63_31 Int)) (or (not (< c_main_~x~0 (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296))) (<= 1 v_it_5)))))))))) is different from false [2022-03-20 04:20:25,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_63_31 Int)) (or (<= 4294967296 aux_mod_v_main_~x~0_63_31) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_63_31 Int)) (not (= (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) c_main_~x~0))) .cse0) (or (not .cse0) (forall ((v_main_~x~0_64 Int)) (or (not (< c_main_~x~0 v_main_~x~0_64)) (let ((.cse1 (< 0 (mod (+ c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0) 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_63_31 Int)) (not (= (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) v_main_~x~0_64))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~x~0_63_31 Int)) (or (not (< v_main_~x~0_64 (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_64 v_it_5 1) (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)))))))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 c_main_~x~0 1) v_main_~x~0_64)))))))) (<= aux_mod_v_main_~x~0_63_31 0))) is different from false [2022-03-20 04:20:55,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_63_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (< 0 (mod c_main_~x~0 4294967296))) .cse0 (forall ((aux_div_v_main_~x~0_63_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_63_31 v_it_4 (* aux_div_v_main_~x~0_63_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_4))) (not (< (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) c_main_~x~0))))) (or (not .cse0) (and (forall ((v_main_~x~0_64 Int) (aux_mod_v_main_~x~0_65_75 Int) (aux_div_v_main_~x~0_63_31 Int) (aux_div_v_main_~x~0_65_75 Int)) (let ((.cse2 (+ aux_mod_v_main_~x~0_65_75 (* aux_div_v_main_~x~0_65_75 4294967296)))) (or (<= (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) v_main_~x~0_64) (let ((.cse3 (< 0 (mod c_main_~x~0 4294967296))) (.cse1 (+ c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0))) (and (or (not (= .cse1 .cse2)) .cse3) (or (not .cse3) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_v_main_~x~0_65_75 v_it_4 (* aux_div_v_main_~x~0_65_75 4294967296) 1) (+ c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0)))) (not (< .cse2 .cse1))))) (<= 4294967296 aux_mod_v_main_~x~0_65_75) (exists ((v_it_5 Int)) (and (<= (+ aux_mod_v_main_~x~0_65_75 v_it_5 (* aux_div_v_main_~x~0_65_75 4294967296) 1) (+ (* v_main_~x~0_64 4294967296) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= aux_mod_v_main_~x~0_65_75 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_65_75 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_64 v_it_5 1) (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296))))) (<= (+ (* v_main_~x~0_64 4294967296) c_main_~z~0) .cse2)))) (forall ((aux_mod_v_main_~x~0_65_86 Int) (aux_div_v_main_~x~0_63_31 Int) (aux_div_v_main_~x~0_65_86 Int)) (let ((.cse4 (+ aux_mod_v_main_~x~0_65_86 (* aux_div_v_main_~x~0_65_86 4294967296)))) (or (< 0 aux_mod_v_main_~x~0_65_86) (let ((.cse6 (< 0 (mod c_main_~x~0 4294967296))) (.cse5 (+ (* aux_mod_v_main_~x~0_63_31 4294967295) c_main_~x~0 c_main_~z~0))) (and (or (not (< .cse4 .cse5)) (not .cse6) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_v_main_~x~0_65_86 v_it_4 (* aux_div_v_main_~x~0_65_86 4294967296) 1) (+ (* aux_mod_v_main_~x~0_63_31 4294967295) c_main_~x~0 c_main_~z~0))))) (or .cse6 (not (= .cse4 .cse5))))) (< aux_mod_v_main_~x~0_65_86 0) (<= (+ (* aux_mod_v_main_~x~0_63_31 4294967296) (* aux_div_v_main_~x~0_63_31 4294967296) c_main_~z~0) .cse4) (exists ((v_it_5 Int)) (and (<= (+ aux_mod_v_main_~x~0_65_86 v_it_5 (* aux_div_v_main_~x~0_65_86 4294967296) 1) (+ (* aux_mod_v_main_~x~0_63_31 4294967296) (* aux_div_v_main_~x~0_63_31 4294967296) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5)))))))))) (<= 4294967296 aux_mod_v_main_~x~0_63_31) (<= aux_mod_v_main_~x~0_63_31 0))) is different from false [2022-03-20 04:20:57,852 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~x~0_63_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not (< 0 (mod c_main_~x~0 4294967296))) .cse0 (forall ((aux_div_v_main_~x~0_63_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_v_main_~x~0_63_31 v_it_4 (* aux_div_v_main_~x~0_63_31 4294967296) 1) c_main_~x~0) (<= 1 v_it_4))) (not (< (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) c_main_~x~0))))) (or (not .cse0) (and (forall ((v_main_~x~0_64 Int) (aux_mod_v_main_~x~0_65_75 Int) (aux_div_v_main_~x~0_63_31 Int) (aux_div_v_main_~x~0_65_75 Int)) (let ((.cse2 (+ aux_mod_v_main_~x~0_65_75 (* aux_div_v_main_~x~0_65_75 4294967296)))) (or (<= (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296)) v_main_~x~0_64) (let ((.cse3 (< 0 (mod c_main_~x~0 4294967296))) (.cse1 (+ c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0))) (and (or (not (= .cse1 .cse2)) .cse3) (or (not .cse3) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_v_main_~x~0_65_75 v_it_4 (* aux_div_v_main_~x~0_65_75 4294967296) 1) (+ c_main_~x~0 (* v_main_~x~0_64 4294967295) c_main_~z~0)))) (not (< .cse2 .cse1))))) (<= 4294967296 aux_mod_v_main_~x~0_65_75) (exists ((v_it_5 Int)) (and (<= (+ aux_mod_v_main_~x~0_65_75 v_it_5 (* aux_div_v_main_~x~0_65_75 4294967296) 1) (+ (* v_main_~x~0_64 4294967296) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= aux_mod_v_main_~x~0_65_75 0) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~x~0_65_75 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~x~0_64 v_it_5 1) (+ aux_mod_v_main_~x~0_63_31 (* aux_div_v_main_~x~0_63_31 4294967296))))) (<= (+ (* v_main_~x~0_64 4294967296) c_main_~z~0) .cse2)))) (forall ((aux_mod_v_main_~x~0_65_86 Int) (aux_div_v_main_~x~0_63_31 Int) (aux_div_v_main_~x~0_65_86 Int)) (let ((.cse4 (+ aux_mod_v_main_~x~0_65_86 (* aux_div_v_main_~x~0_65_86 4294967296)))) (or (< 0 aux_mod_v_main_~x~0_65_86) (let ((.cse6 (< 0 (mod c_main_~x~0 4294967296))) (.cse5 (+ (* aux_mod_v_main_~x~0_63_31 4294967295) c_main_~x~0 c_main_~z~0))) (and (or (not (< .cse4 .cse5)) (not .cse6) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ aux_mod_v_main_~x~0_65_86 v_it_4 (* aux_div_v_main_~x~0_65_86 4294967296) 1) (+ (* aux_mod_v_main_~x~0_63_31 4294967295) c_main_~x~0 c_main_~z~0))))) (or .cse6 (not (= .cse4 .cse5))))) (< aux_mod_v_main_~x~0_65_86 0) (<= (+ (* aux_mod_v_main_~x~0_63_31 4294967296) (* aux_div_v_main_~x~0_63_31 4294967296) c_main_~z~0) .cse4) (exists ((v_it_5 Int)) (and (<= (+ aux_mod_v_main_~x~0_65_86 v_it_5 (* aux_div_v_main_~x~0_65_86 4294967296) 1) (+ (* aux_mod_v_main_~x~0_63_31 4294967296) (* aux_div_v_main_~x~0_63_31 4294967296) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5)))))))))) (<= 4294967296 aux_mod_v_main_~x~0_63_31) (<= aux_mod_v_main_~x~0_63_31 0))) is different from true [2022-03-20 04:21:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-03-20 04:21:15,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669989725] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:21:15,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:21:15,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 9] total 16 [2022-03-20 04:21:15,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766741691] [2022-03-20 04:21:15,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:21:15,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 04:21:15,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:21:15,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 04:21:15,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=123, Unknown=5, NotChecked=72, Total=240 [2022-03-20 04:21:15,935 INFO L87 Difference]: Start difference. First operand 55 states and 88 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:21:16,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:21:16,580 INFO L93 Difference]: Finished difference Result 73 states and 113 transitions. [2022-03-20 04:21:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 04:21:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-20 04:21:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:21:16,587 INFO L225 Difference]: With dead ends: 73 [2022-03-20 04:21:16,587 INFO L226 Difference]: Without dead ends: 69 [2022-03-20 04:21:16,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 38 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=101, Invalid=326, Unknown=5, NotChecked=120, Total=552 [2022-03-20 04:21:16,588 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:21:16,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 56 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 70 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2022-03-20 04:21:16,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-03-20 04:21:16,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-03-20 04:21:16,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.679245283018868) internal successors, (89), 53 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:21:16,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 93 transitions. [2022-03-20 04:21:16,590 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 93 transitions. Word has length 20 [2022-03-20 04:21:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:21:16,590 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 93 transitions. [2022-03-20 04:21:16,591 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 13 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:21:16,591 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-03-20 04:21:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:21:16,591 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:21:16,591 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:21:16,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-20 04:21:16,805 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:21:16,806 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:21:16,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:21:16,806 INFO L85 PathProgramCache]: Analyzing trace with hash -127189554, now seen corresponding path program 1 times [2022-03-20 04:21:16,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:21:16,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943764005] [2022-03-20 04:21:16,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:21:16,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:21:16,809 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-20 04:21:16,810 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:21:16,811 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:21:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:21:16,818 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:21:16,819 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:21:16,821 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_10 .cse0 (* (- 4294967296) (div (+ main_~z~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:21:16,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:21:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:21:16,956 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-20 04:21:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:21:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943764005] [2022-03-20 04:21:16,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943764005] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:21:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461159714] [2022-03-20 04:21:16,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:21:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:21:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:21:16,957 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:21:16,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process