/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 15:24:54,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:24:54,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:24:54,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:24:54,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:24:54,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:24:54,368 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:24:54,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:24:54,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:24:54,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:24:54,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:24:54,380 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:24:54,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:24:54,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:24:54,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:24:54,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:24:54,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:24:54,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:24:54,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:24:54,396 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:24:54,398 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:24:54,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:24:54,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:24:54,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:24:54,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:24:54,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:24:54,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:24:54,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:24:54,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:24:54,410 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:24:54,411 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:24:54,411 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:24:54,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:24:54,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:24:54,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:24:54,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:24:54,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:24:54,415 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:24:54,416 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:24:54,416 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:24:54,416 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:24:54,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:24:54,418 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:24:54,430 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:24:54,430 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:24:54,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:24:54,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:24:54,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:24:54,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:24:54,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:24:54,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:24:54,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:24:54,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:24:54,432 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:24:54,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:24:54,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:24:54,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:24:54,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:24:54,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:24:54,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:24:54,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:24:54,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:24:54,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:24:54,434 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:24:54,434 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:24:54,434 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-17 15:24:54,669 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:24:54,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:24:54,700 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:24:54,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:24:54,701 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:24:54,702 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-03-17 15:24:54,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bee2d285/1a3a419b97104af5accef8a602f7c7d2/FLAG5b8663232 [2022-03-17 15:24:55,096 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:24:55,097 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c [2022-03-17 15:24:55,101 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bee2d285/1a3a419b97104af5accef8a602f7c7d2/FLAG5b8663232 [2022-03-17 15:24:55,111 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bee2d285/1a3a419b97104af5accef8a602f7c7d2 [2022-03-17 15:24:55,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:24:55,114 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:24:55,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:24:55,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:24:55,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:24:55,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,120 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65863d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55, skipping insertion in model container [2022-03-17 15:24:55,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:24:55,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:24:55,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c[368,381] [2022-03-17 15:24:55,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:24:55,292 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:24:55,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de52.c[368,381] [2022-03-17 15:24:55,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:24:55,316 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:24:55,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55 WrapperNode [2022-03-17 15:24:55,316 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:24:55,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:24:55,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:24:55,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:24:55,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,365 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:24:55,367 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:24:55,367 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:24:55,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:24:55,369 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:24:55,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:55,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-17 15:24:55,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-17 15:24:55,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:24:55,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:24:55,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:24:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:24:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:24:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:24:55,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:24:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-17 15:24:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:24:55,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:24:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:24:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:24:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:24:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:24:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:24:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:24:55,521 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:24:55,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:24:55,651 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:24:55,670 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:24:55,670 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-03-17 15:24:55,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:24:55 BoogieIcfgContainer [2022-03-17 15:24:55,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:24:55,673 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:24:55,673 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:24:55,684 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:24:55,689 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:24:55" (1/1) ... [2022-03-17 15:24:55,891 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:24:55,892 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-03-17 15:24:56,070 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:24:56,071 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (= v_main_~z~0_8 (+ v_main_~z~0_7 1)) (< 0 (mod v_main_~z~0_8 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_8} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_7, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_8 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= v_main_~z~0_8 v_main_~z~0_7) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (forall ((v_it_2 Int)) (or (< 0 (mod (+ v_main_~z~0_8 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~z~0_7 v_it_2 1) v_main_~z~0_8)) (not (<= 1 v_it_2)))) (= (+ v_main_~x~0_9 v_main_~z~0_8 (* (- 1) v_main_~z~0_7)) v_main_~x~0_8) (< 0 .cse0) (< v_main_~z~0_7 v_main_~z~0_8)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_8, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-03-17 15:24:56,141 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:24:56,142 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_4 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_3, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-03-17 15:24:58,273 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:24:58,273 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= (+ v_main_~y~0_8 1) v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_7, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~y~0_8) v_main_~y~0_7)) (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~y~0_8 v_main_~y~0_7) (= v_main_~x~0_7 v_main_~x~0_6)))) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-03-17 15:24:58,359 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:24:58,360 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296)) (= v_main_~y~0_11 (+ v_main_~y~0_10 1))) InVars {main_~z~0=v_main_~z~0_10, main_~y~0=v_main_~y~0_11} OutVars{main_~z~0=v_main_~z~0_9, main_~y~0=v_main_~y~0_10, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~z~0, main_~y~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_10 4294967296))) (or (and (= v_main_~y~0_10 (+ v_main_~y~0_11 v_main_~z~0_9 (* (- 1) v_main_~z~0_10))) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~z~0_9 v_it_5 1) v_main_~z~0_10)) (< 0 (mod (+ v_main_~z~0_10 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (< v_main_~z~0_9 v_main_~z~0_10)) (and (<= .cse0 0) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)))) InVars {main_~y~0=v_main_~y~0_11, main_~z~0=v_main_~z~0_10, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~y~0=v_main_~y~0_10, main_~z~0=v_main_~z~0_9, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~z~0, main_~y~0, main_#t~post13, main_#t~post14] [2022-03-17 15:24:58,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:24:58 BasicIcfg [2022-03-17 15:24:58,364 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:24:58,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:24:58,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:24:58,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:24:58,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:24:55" (1/4) ... [2022-03-17 15:24:58,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ee97f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:58, skipping insertion in model container [2022-03-17 15:24:58,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:24:55" (2/4) ... [2022-03-17 15:24:58,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ee97f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:24:58, skipping insertion in model container [2022-03-17 15:24:58,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:24:55" (3/4) ... [2022-03-17 15:24:58,370 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54ee97f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:24:58, skipping insertion in model container [2022-03-17 15:24:58,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:24:58" (4/4) ... [2022-03-17 15:24:58,371 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de52.cJordan [2022-03-17 15:24:58,375 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:24:58,375 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:24:58,409 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:24:58,415 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-17 15:24:58,415 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:24:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 15:24:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 15:24:58,432 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:58,433 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:58,433 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:58,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:58,437 INFO L85 PathProgramCache]: Analyzing trace with hash 702671213, now seen corresponding path program 1 times [2022-03-17 15:24:58,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:58,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197099056] [2022-03-17 15:24:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:58,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:58,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:58,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:58,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:58,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197099056] [2022-03-17 15:24:58,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197099056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:24:58,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:24:58,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 15:24:58,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752315667] [2022-03-17 15:24:58,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:24:58,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 15:24:58,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:58,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 15:24:58,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:24:58,610 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:24:58,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:58,641 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-03-17 15:24:58,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 15:24:58,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-17 15:24:58,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:58,658 INFO L225 Difference]: With dead ends: 24 [2022-03-17 15:24:58,659 INFO L226 Difference]: Without dead ends: 17 [2022-03-17 15:24:58,660 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:24:58,666 INFO L912 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:24:58,668 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:24:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-03-17 15:24:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-03-17 15:24:58,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:24:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-03-17 15:24:58,699 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-03-17 15:24:58,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:58,700 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-03-17 15:24:58,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:24:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-03-17 15:24:58,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-17 15:24:58,701 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:58,702 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:58,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:24:58,702 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:58,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:58,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1128942900, now seen corresponding path program 1 times [2022-03-17 15:24:58,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:58,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786230229] [2022-03-17 15:24:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:58,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:58,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:58,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786230229] [2022-03-17 15:24:58,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786230229] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:24:58,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:24:58,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-17 15:24:58,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228087802] [2022-03-17 15:24:58,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:24:58,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-17 15:24:58,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:24:58,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-17 15:24:58,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-17 15:24:58,857 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:24:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:24:58,923 INFO L93 Difference]: Finished difference Result 28 states and 38 transitions. [2022-03-17 15:24:58,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-17 15:24:58,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-17 15:24:58,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:24:58,925 INFO L225 Difference]: With dead ends: 28 [2022-03-17 15:24:58,925 INFO L226 Difference]: Without dead ends: 25 [2022-03-17 15:24:58,925 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-03-17 15:24:58,927 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:24:58,927 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 33 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-03-17 15:24:58,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-17 15:24:58,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-03-17 15:24:58,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:24:58,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-03-17 15:24:58,932 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 16 [2022-03-17 15:24:58,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:24:58,932 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-03-17 15:24:58,932 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:24:58,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-03-17 15:24:58,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:24:58,933 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:24:58,933 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:24:58,933 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:24:58,933 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:24:58,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:24:58,934 INFO L85 PathProgramCache]: Analyzing trace with hash -610770875, now seen corresponding path program 1 times [2022-03-17 15:24:58,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:24:58,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323385378] [2022-03-17 15:24:58,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:58,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:24:58,949 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:24:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:58,975 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:24:59,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:24:59,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:59,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:24:59,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323385378] [2022-03-17 15:24:59,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323385378] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:24:59,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674266328] [2022-03-17 15:24:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:24:59,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:24:59,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:24:59,086 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:24:59,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-17 15:24:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:24:59,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 15:24:59,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:24:59,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:24:59,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:25:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:08,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674266328] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:08,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:08,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-17 15:25:08,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034251280] [2022-03-17 15:25:08,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:08,465 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:25:08,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:08,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:25:08,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=140, Unknown=3, NotChecked=0, Total=182 [2022-03-17 15:25:08,466 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:08,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:08,709 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-03-17 15:25:08,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 15:25:08,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 11 states have internal predecessors, (27), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-17 15:25:08,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:08,711 INFO L225 Difference]: With dead ends: 36 [2022-03-17 15:25:08,711 INFO L226 Difference]: Without dead ends: 32 [2022-03-17 15:25:08,712 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=102, Invalid=357, Unknown=3, NotChecked=0, Total=462 [2022-03-17 15:25:08,713 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:08,713 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 63 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 18 Unchecked, 0.1s Time] [2022-03-17 15:25:08,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-17 15:25:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2022-03-17 15:25:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 17 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-03-17 15:25:08,717 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 17 [2022-03-17 15:25:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:08,718 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-03-17 15:25:08,718 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-03-17 15:25:08,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:25:08,718 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:08,719 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:08,749 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-17 15:25:08,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:08,932 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:08,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash 162216202, now seen corresponding path program 1 times [2022-03-17 15:25:08,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:08,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693164737] [2022-03-17 15:25:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:08,950 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:25:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:08,975 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:25:09,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:09,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693164737] [2022-03-17 15:25:09,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693164737] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:09,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414635110] [2022-03-17 15:25:09,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:09,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:09,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:09,091 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:25:09,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-17 15:25:09,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:09,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 15:25:09,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:09,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:25:12,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:12,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414635110] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:12,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:12,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-17 15:25:12,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109513852] [2022-03-17 15:25:12,288 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:12,288 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:25:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:12,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:25:12,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-03-17 15:25:12,289 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:12,495 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-03-17 15:25:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 15:25:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-17 15:25:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:12,497 INFO L225 Difference]: With dead ends: 42 [2022-03-17 15:25:12,497 INFO L226 Difference]: Without dead ends: 38 [2022-03-17 15:25:12,497 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2022-03-17 15:25:12,498 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:12,498 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 64 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 72 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-03-17 15:25:12,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-03-17 15:25:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2022-03-17 15:25:12,502 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-17 15:25:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-17 15:25:12,503 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 17 [2022-03-17 15:25:12,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:12,503 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-17 15:25:12,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 11 states have internal predecessors, (26), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-17 15:25:12,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:12,506 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:12,506 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:12,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-17 15:25:12,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-17 15:25:12,720 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:12,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:12,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1727307284, now seen corresponding path program 2 times [2022-03-17 15:25:12,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:12,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384645423] [2022-03-17 15:25:12,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:12,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:12,731 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:12,732 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_11 .cse0 (* (- 4294967296) (div (+ main_~z~0_11 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:12,785 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:12,788 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_11 .cse0 (* (- 4294967296) (div (+ main_~z~0_11 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:12,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384645423] [2022-03-17 15:25:12,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384645423] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:12,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350352570] [2022-03-17 15:25:12,891 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:25:12,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:12,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:12,893 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:25:12,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-17 15:25:12,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:25:12,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:25:12,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:25:12,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:13,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:13,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:25:21,470 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_20_31 Int)) (or (<= aux_mod_v_main_~y~0_20_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_20_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_20_31 4294967296) aux_mod_v_main_~y~0_20_31) c_main_~y~0))) .cse0) (or (not .cse0) (and (or (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_20_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_20_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_20_31 4294967296) aux_mod_v_main_~y~0_20_31 1) c_main_~y~0) (<= 1 v_it_5))) (not (< (+ (* aux_div_v_main_~y~0_20_31 4294967296) aux_mod_v_main_~y~0_20_31) c_main_~y~0))))) (forall ((aux_div_v_main_~y~0_21_70 Int) (aux_mod_v_main_~y~0_21_70 Int) (aux_div_v_main_~y~0_20_31 Int)) (let ((.cse1 (+ (* aux_div_v_main_~y~0_21_70 4294967296) aux_mod_v_main_~y~0_21_70))) (or (<= 4294967296 aux_mod_v_main_~y~0_21_70) (<= aux_mod_v_main_~y~0_21_70 0) (<= .cse1 (+ (* 4294967295 c_main_~y~0) (* aux_div_v_main_~y~0_20_31 4294967296) aux_mod_v_main_~y~0_20_31 c_main_~z~0)) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) (* aux_div_v_main_~y~0_20_31 4294967296) aux_mod_v_main_~y~0_20_31 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_21_70 4294967296) aux_mod_v_main_~y~0_21_70)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_21_70 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ (* aux_div_v_main_~y~0_21_70 4294967296) v_it_5 aux_mod_v_main_~y~0_21_70 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (<= 1 v_it_5))) (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse1)))))))) (<= 4294967296 aux_mod_v_main_~y~0_20_31))) is different from false [2022-03-17 15:25:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-17 15:25:47,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350352570] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:47,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:47,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-03-17 15:25:47,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750514297] [2022-03-17 15:25:47,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:47,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 15:25:47,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:47,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 15:25:47,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=162, Unknown=6, NotChecked=26, Total=240 [2022-03-17 15:25:47,707 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:00,368 WARN L232 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 79 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:26:00,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:00,449 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2022-03-17 15:26:00,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 15:26:00,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:26:00,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:00,450 INFO L225 Difference]: With dead ends: 42 [2022-03-17 15:26:00,450 INFO L226 Difference]: Without dead ends: 32 [2022-03-17 15:26:00,451 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 37.3s TimeCoverageRelationStatistics Valid=113, Invalid=389, Unknown=8, NotChecked=42, Total=552 [2022-03-17 15:26:00,451 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:00,452 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 53 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 45 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-03-17 15:26:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-03-17 15:26:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-03-17 15:26:00,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 19 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-03-17 15:26:00,455 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 18 [2022-03-17 15:26:00,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:00,455 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-03-17 15:26:00,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 13 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-03-17 15:26:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:00,456 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:00,456 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:00,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-17 15:26:00,675 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:00,676 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:00,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash 760455623, now seen corresponding path program 1 times [2022-03-17 15:26:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:00,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089844030] [2022-03-17 15:26:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:00,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:00,683 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:26:00,684 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:00,711 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:26:00,715 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:00,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:00,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:00,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089844030] [2022-03-17 15:26:00,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089844030] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:00,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203449289] [2022-03-17 15:26:00,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:00,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:00,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:00,814 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:26:00,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-17 15:26:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:00,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-17 15:26:00,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:01,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:26:30,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203449289] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:30,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:30,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 20 [2022-03-17 15:26:30,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410124565] [2022-03-17 15:26:30,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:30,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:26:30,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:30,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:26:30,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=299, Unknown=7, NotChecked=0, Total=380 [2022-03-17 15:26:30,586 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:33,087 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-03-17 15:26:33,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-17 15:26:33,087 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:26:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:33,088 INFO L225 Difference]: With dead ends: 41 [2022-03-17 15:26:33,088 INFO L226 Difference]: Without dead ends: 37 [2022-03-17 15:26:33,089 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=185, Invalid=799, Unknown=8, NotChecked=0, Total=992 [2022-03-17 15:26:33,089 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:33,090 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 93 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 102 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-03-17 15:26:33,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-17 15:26:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2022-03-17 15:26:33,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-03-17 15:26:33,095 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 18 [2022-03-17 15:26:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:33,096 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-03-17 15:26:33,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.55) internal successors, (31), 17 states have internal predecessors, (31), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-03-17 15:26:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:26:33,096 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:33,096 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:26:33,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-17 15:26:33,315 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:33,315 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:33,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:33,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1533442700, now seen corresponding path program 2 times [2022-03-17 15:26:33,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148734289] [2022-03-17 15:26:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:33,321 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:26:33,323 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-03-17 15:26:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:33,335 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:26:33,338 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-03-17 15:26:33,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:33,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:33,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:33,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148734289] [2022-03-17 15:26:33,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148734289] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:33,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708330419] [2022-03-17 15:26:33,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:26:33,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:33,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:33,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:26:33,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-17 15:26:33,454 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:26:33,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:26:33,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:26:33,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:33,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:33,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:19,066 WARN L232 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:27:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:24,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708330419] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:24,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:24,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-03-17 15:27:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252488416] [2022-03-17 15:27:24,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:24,212 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 15:27:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:24,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 15:27:24,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=177, Unknown=15, NotChecked=0, Total=240 [2022-03-17 15:27:24,212 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:30,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:30,453 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2022-03-17 15:27:30,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:27:30,454 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:27:30,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:30,454 INFO L225 Difference]: With dead ends: 44 [2022-03-17 15:27:30,455 INFO L226 Difference]: Without dead ends: 40 [2022-03-17 15:27:30,455 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 43.7s TimeCoverageRelationStatistics Valid=104, Invalid=384, Unknown=18, NotChecked=0, Total=506 [2022-03-17 15:27:30,456 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:30,456 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 74 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 86 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2022-03-17 15:27:30,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-03-17 15:27:30,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2022-03-17 15:27:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-03-17 15:27:30,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 18 [2022-03-17 15:27:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:30,460 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-03-17 15:27:30,460 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 13 states have internal predecessors, (32), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:30,460 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-03-17 15:27:30,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:27:30,461 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:30,461 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:27:30,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-17 15:27:30,663 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:30,664 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:30,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:30,664 INFO L85 PathProgramCache]: Analyzing trace with hash 571694412, now seen corresponding path program 1 times [2022-03-17 15:27:30,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:30,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890343680] [2022-03-17 15:27:30,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:30,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:30,669 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:30,670 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:30,694 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:30,706 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:30,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:27:30,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:30,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890343680] [2022-03-17 15:27:30,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890343680] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:30,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971879717] [2022-03-17 15:27:30,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:30,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:30,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:30,775 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:27:30,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-17 15:27:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:30,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 15:27:30,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:27:30,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:44,209 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~y~0_32_31 Int)) (or (= aux_mod_v_main_~y~0_32_31 0) (and (forall ((aux_div_v_main_~y~0_32_31 Int) (aux_mod_v_main_~z~0_25_31 Int) (aux_div_v_main_~z~0_25_31 Int)) (let ((.cse0 (* 4294967296 aux_div_v_main_~z~0_25_31))) (or (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31)) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (<= 4294967296 aux_mod_v_main_~z~0_25_31) (<= (+ .cse0 aux_mod_v_main_~z~0_25_31) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (<= (+ (* 4294967296 aux_div_v_main_~z~0_25_31) aux_mod_v_main_~z~0_25_31 v_it_5 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) (+ c_main_~y~0 c_main_~z~0)) (not (< 0 (mod (+ aux_mod_v_main_~z~0_25_31 (* v_it_5 4294967295)) 4294967296))))) (<= (+ c_main_~y~0 c_main_~z~0) (+ .cse0 aux_mod_v_main_~z~0_25_31 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31)) (<= aux_mod_v_main_~z~0_25_31 0)))) (or (forall ((aux_div_v_main_~y~0_32_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31) c_main_~y~0)) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 (* aux_div_v_main_~y~0_32_31 4294967296) aux_mod_v_main_~y~0_32_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))))) (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_32_31) c_main_~y~0 c_main_~z~0) 4294967296)))) (>= aux_mod_v_main_~y~0_32_31 4294967296) (> 0 aux_mod_v_main_~y~0_32_31))) (not (< 0 (mod c_main_~y~0 4294967296))) (< 0 (mod c_main_~z~0 4294967296))) is different from true [2022-03-17 15:27:44,223 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-17 15:27:44,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971879717] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:44,223 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:44,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 8] total 14 [2022-03-17 15:27:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010463155] [2022-03-17 15:27:44,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:44,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:27:44,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:44,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:27:44,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=120, Unknown=5, NotChecked=22, Total=182 [2022-03-17 15:27:44,225 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:01,269 WARN L232 SmtUtils]: Spent 14.10s on a formula simplification that was a NOOP. DAG size: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:28:35,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:35,532 INFO L93 Difference]: Finished difference Result 45 states and 63 transitions. [2022-03-17 15:28:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-17 15:28:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:28:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:35,533 INFO L225 Difference]: With dead ends: 45 [2022-03-17 15:28:35,533 INFO L226 Difference]: Without dead ends: 41 [2022-03-17 15:28:35,533 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 62.1s TimeCoverageRelationStatistics Valid=102, Invalid=349, Unknown=15, NotChecked=40, Total=506 [2022-03-17 15:28:35,534 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:35,535 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 74 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 71 Unchecked, 0.1s Time] [2022-03-17 15:28:35,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-03-17 15:28:35,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2022-03-17 15:28:35,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 29 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 50 transitions. [2022-03-17 15:28:35,539 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 50 transitions. Word has length 18 [2022-03-17 15:28:35,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:35,539 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-03-17 15:28:35,540 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), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:35,540 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 50 transitions. [2022-03-17 15:28:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:28:35,540 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:35,540 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:28:35,561 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-17 15:28:35,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:35,752 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:35,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:35,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1344681489, now seen corresponding path program 1 times [2022-03-17 15:28:35,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:35,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652032755] [2022-03-17 15:28:35,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:35,761 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:35,762 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:28:35,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:35,775 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:35,777 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:28:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:35,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:35,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652032755] [2022-03-17 15:28:35,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652032755] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:28:35,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160916270] [2022-03-17 15:28:35,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:35,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:35,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:28:35,864 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:28:35,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-17 15:28:35,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:35,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 6 conjunts are in the unsatisfiable core [2022-03-17 15:28:35,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:28:35,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:35,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:28:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:38,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160916270] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:28:38,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:28:38,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-03-17 15:28:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838807078] [2022-03-17 15:28:38,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:28:38,654 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-17 15:28:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-17 15:28:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=142, Unknown=1, NotChecked=0, Total=182 [2022-03-17 15:28:38,655 INFO L87 Difference]: Start difference. First operand 34 states and 50 transitions. Second operand has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:38,850 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2022-03-17 15:28:38,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-17 15:28:38,851 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:28:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:38,852 INFO L225 Difference]: With dead ends: 53 [2022-03-17 15:28:38,852 INFO L226 Difference]: Without dead ends: 49 [2022-03-17 15:28:38,852 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=102, Invalid=359, Unknown=1, NotChecked=0, Total=462 [2022-03-17 15:28:38,853 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:38,853 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 76 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 90 Invalid, 0 Unknown, 19 Unchecked, 0.1s Time] [2022-03-17 15:28:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-17 15:28:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-03-17 15:28:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 31 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 54 transitions. [2022-03-17 15:28:38,856 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 54 transitions. Word has length 18 [2022-03-17 15:28:38,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:38,857 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 54 transitions. [2022-03-17 15:28:38,857 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), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 54 transitions. [2022-03-17 15:28:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:28:38,857 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:38,857 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:28:38,874 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-17 15:28:39,063 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:39,064 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:39,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:39,064 INFO L85 PathProgramCache]: Analyzing trace with hash -211948756, now seen corresponding path program 1 times [2022-03-17 15:28:39,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:39,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834885603] [2022-03-17 15:28:39,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:39,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:39,070 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:39,072 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-17 15:28:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:39,090 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:39,094 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-17 15:28:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:39,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:28:39,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834885603] [2022-03-17 15:28:39,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834885603] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:28:39,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724222182] [2022-03-17 15:28:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:39,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:39,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:28:39,193 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:28:39,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-17 15:28:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:39,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 15:28:39,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:28:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:28:39,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:28:54,369 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-17 15:28:54,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724222182] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:28:54,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:28:54,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 15 [2022-03-17 15:28:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705987921] [2022-03-17 15:28:54,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:28:54,370 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-17 15:28:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-17 15:28:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=160, Unknown=5, NotChecked=0, Total=210 [2022-03-17 15:28:54,370 INFO L87 Difference]: Start difference. First operand 36 states and 54 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:16,793 WARN L232 SmtUtils]: Spent 14.20s on a formula simplification that was a NOOP. DAG size: 86 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:29:35,543 WARN L232 SmtUtils]: Spent 16.50s on a formula simplification. DAG size of input: 92 DAG size of output: 90 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:29:43,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:29:43,924 INFO L93 Difference]: Finished difference Result 57 states and 85 transitions. [2022-03-17 15:29:43,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-17 15:29:43,925 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:29:43,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:29:43,926 INFO L225 Difference]: With dead ends: 57 [2022-03-17 15:29:43,926 INFO L226 Difference]: Without dead ends: 53 [2022-03-17 15:29:43,926 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=129, Invalid=458, Unknown=13, NotChecked=0, Total=600 [2022-03-17 15:29:43,927 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 33 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:29:43,927 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 56 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 45 Invalid, 0 Unknown, 48 Unchecked, 0.0s Time] [2022-03-17 15:29:43,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-03-17 15:29:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 40. [2022-03-17 15:29:43,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 35 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 61 transitions. [2022-03-17 15:29:43,931 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 61 transitions. Word has length 18 [2022-03-17 15:29:43,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:29:43,931 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 61 transitions. [2022-03-17 15:29:43,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 12 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 61 transitions. [2022-03-17 15:29:43,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:29:43,932 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:29:43,932 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:29:43,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-17 15:29:44,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-03-17 15:29:44,148 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:29:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:29:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2126008490, now seen corresponding path program 2 times [2022-03-17 15:29:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:29:44,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089029584] [2022-03-17 15:29:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:29:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:29:44,152 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:29:44,153 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:44,153 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-17 15:29:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:44,167 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:29:44,169 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:44,171 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:44,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:29:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:44,296 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-17 15:29:44,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:29:44,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089029584] [2022-03-17 15:29:44,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089029584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:29:44,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674585263] [2022-03-17 15:29:44,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:29:44,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:29:44,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:29:44,298 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:29:44,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-17 15:29:44,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:29:44,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:29:44,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:29:44,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:29:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:29:44,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:30:23,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~y~0_44 Int) (aux_mod_v_main_~y~0_42_31 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_42_31) (<= aux_mod_v_main_~y~0_42_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_44) (<= 1 v_it_4))) (not .cse0) (not (< c_main_~y~0 v_main_~y~0_44))) (or .cse0 (not (= v_main_~y~0_44 c_main_~y~0))))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_42_31 Int)) (not (= v_main_~y~0_44 (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31)))) .cse1) (or (not .cse1) (and (forall ((aux_mod_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_43_70 Int) (aux_div_v_main_~y~0_42_31 Int)) (let ((.cse2 (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))) (or (<= 4294967296 aux_mod_v_main_~y~0_43_70) (<= .cse2 (+ (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0)) (<= aux_mod_v_main_~y~0_43_70 0) (<= (+ (* v_main_~y~0_44 4294967296) c_main_~z~0) .cse2) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296) 1) (+ (* v_main_~y~0_44 4294967296) c_main_~z~0)))) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_43_70 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* v_main_~y~0_44 4294967295) (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 c_main_~z~0 1) (+ aux_mod_v_main_~y~0_43_70 (* aux_div_v_main_~y~0_43_70 4294967296)))))))) (or (< 0 (mod (+ (* v_main_~y~0_44 4294967295) aux_mod_v_main_~y~0_42_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_42_31 Int)) (or (not (< (+ (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31) v_main_~y~0_44)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_42_31 4294967296) aux_mod_v_main_~y~0_42_31 1) v_main_~y~0_44) (<= 1 v_it_5)))))))))))) is different from false [2022-03-17 15:31:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:31:03,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674585263] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:31:03,967 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:31:03,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 21 [2022-03-17 15:31:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947221067] [2022-03-17 15:31:03,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:31:03,968 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-17 15:31:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:31:03,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-17 15:31:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=294, Unknown=12, NotChecked=36, Total=420 [2022-03-17 15:31:03,969 INFO L87 Difference]: Start difference. First operand 40 states and 61 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:31:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:31:14,729 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-03-17 15:31:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-17 15:31:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:31:14,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:31:14,730 INFO L225 Difference]: With dead ends: 57 [2022-03-17 15:31:14,730 INFO L226 Difference]: Without dead ends: 47 [2022-03-17 15:31:14,730 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 40.5s TimeCoverageRelationStatistics Valid=194, Invalid=785, Unknown=17, NotChecked=60, Total=1056 [2022-03-17 15:31:14,731 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 34 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 70 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:31:14,731 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 99 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 114 Invalid, 0 Unknown, 70 Unchecked, 0.1s Time] [2022-03-17 15:31:14,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-17 15:31:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 40. [2022-03-17 15:31:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:31:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-03-17 15:31:14,735 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 19 [2022-03-17 15:31:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:31:14,735 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-03-17 15:31:14,735 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 18 states have internal predecessors, (34), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:31:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-03-17 15:31:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:31:14,736 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:31:14,736 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:31:14,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-17 15:31:14,960 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:31:14,960 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:31:14,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:31:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 318804101, now seen corresponding path program 3 times [2022-03-17 15:31:14,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:31:14,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669807301] [2022-03-17 15:31:14,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:31:14,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:31:14,965 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:31:14,966 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-03-17 15:31:14,967 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:31:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:31:14,980 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:31:14,983 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_10 (* (- 4294967296) (div (+ .cse0 main_~x~0_10) 4294967296)))) 0)) [2022-03-17 15:31:14,985 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-17 15:31:15,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:31:15,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:31:15,154 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-17 15:31:15,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:31:15,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669807301] [2022-03-17 15:31:15,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669807301] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:31:15,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514766927] [2022-03-17 15:31:15,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-17 15:31:15,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:31:15,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:31:15,156 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:31:15,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-17 15:31:15,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-17 15:31:15,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:31:15,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:31:15,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:31:15,406 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-17 15:31:15,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:31:23,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_48_31 Int) (v_main_~y~0_49 Int)) (or (<= 4294967296 aux_mod_v_main_~y~0_48_31) (<= aux_mod_v_main_~y~0_48_31 0) (let ((.cse0 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse0) (forall ((aux_div_v_main_~y~0_48_31 Int)) (or (not (< (+ aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296)) v_main_~y~0_49)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296) 1) v_main_~y~0_49) (<= 1 v_it_5)))))) (or (forall ((aux_div_v_main_~y~0_48_31 Int)) (not (= v_main_~y~0_49 (+ aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296))))) .cse0))) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse1) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_49))) (not (< c_main_~y~0 v_main_~y~0_49))) (or .cse1 (not (= v_main_~y~0_49 c_main_~y~0))))))) is different from false [2022-03-17 15:32:24,867 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_48_31 Int) (v_main_~y~0_49 Int)) (or (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_main_~y~0_26 Int)) (let ((.cse0 (* 4294967296 aux_div_main_~y~0_26))) (or (< .cse0 v_main_~y~0_49) (< v_main_~y~0_49 .cse0)))) .cse1) (or (and (forall ((aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_main_~y~0_26_81 Int) (aux_div_aux_mod_main_~y~0_26_81 Int)) (let ((.cse2 (* aux_div_aux_mod_main_~y~0_26_81 4294967296))) (let ((.cse4 (+ .cse2 aux_mod_aux_mod_main_~y~0_26_81)) (.cse3 (+ (* v_main_~y~0_49 4294967295) c_main_~x~0))) (or (< 0 aux_mod_aux_mod_main_~y~0_26_81) (<= (+ (* v_main_~y~0_49 4294967296) c_main_~x~0) (+ .cse2 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_main_~y~0_26_81 4294967296) v_it_4 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* v_main_~y~0_49 4294967296) c_main_~x~0)) (<= 1 v_it_4))) (< .cse3 .cse4) (< aux_mod_aux_mod_main_~y~0_26_81 0) (< .cse4 .cse3))))) (forall ((v_main_~y~0_50 Int) (aux_div_main_~y~0_26 Int) (aux_mod_aux_mod_main_~y~0_26_81 Int) (aux_div_aux_mod_main_~y~0_26_81 Int)) (let ((.cse5 (* aux_div_aux_mod_main_~y~0_26_81 4294967296))) (let ((.cse7 (+ (* v_main_~y~0_50 4294967295) c_main_~x~0)) (.cse6 (+ .cse5 aux_mod_aux_mod_main_~y~0_26_81))) (or (<= (+ (* v_main_~y~0_50 4294967296) c_main_~x~0) (+ .cse5 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26))) (<= v_main_~y~0_49 v_main_~y~0_50) (< .cse6 .cse7) (<= 4294967296 aux_mod_aux_mod_main_~y~0_26_81) (< .cse7 .cse6) (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_50 v_it_4 1) v_main_~y~0_49) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) aux_mod_aux_mod_main_~y~0_26_81) 4294967296))))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ (* aux_div_aux_mod_main_~y~0_26_81 4294967296) v_it_4 aux_mod_aux_mod_main_~y~0_26_81 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* v_main_~y~0_50 4294967296) c_main_~x~0)) (<= 1 v_it_4))) (<= aux_mod_aux_mod_main_~y~0_26_81 0)))))) (not .cse1)))) (<= 4294967296 aux_mod_v_main_~y~0_48_31) (<= aux_mod_v_main_~y~0_48_31 0) (let ((.cse8 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse8) (forall ((aux_div_v_main_~y~0_48_31 Int)) (or (not (< (+ aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296)) v_main_~y~0_49)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296) 1) v_main_~y~0_49) (<= 1 v_it_5)))))) (or (forall ((aux_div_v_main_~y~0_48_31 Int)) (not (= v_main_~y~0_49 (+ aux_mod_v_main_~y~0_48_31 (* aux_div_v_main_~y~0_48_31 4294967296))))) .cse8))))) is different from true [2022-03-17 15:32:52,072 WARN L232 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:32:52,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-17 15:32:52,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514766927] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:32:52,082 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:32:52,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2022-03-17 15:32:52,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295339332] [2022-03-17 15:32:52,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:32:52,082 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-17 15:32:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:32:52,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-17 15:32:52,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=324, Unknown=16, NotChecked=78, Total=506 [2022-03-17 15:32:52,083 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 20 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:09,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:33:09,192 INFO L93 Difference]: Finished difference Result 55 states and 79 transitions. [2022-03-17 15:33:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-17 15:33:09,192 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 20 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:33:09,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:33:09,193 INFO L225 Difference]: With dead ends: 55 [2022-03-17 15:33:09,193 INFO L226 Difference]: Without dead ends: 51 [2022-03-17 15:33:09,193 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 9 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 66.1s TimeCoverageRelationStatistics Valid=198, Invalid=782, Unknown=20, NotChecked=122, Total=1122 [2022-03-17 15:33:09,194 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:33:09,194 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 74 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 81 Invalid, 0 Unknown, 95 Unchecked, 0.1s Time] [2022-03-17 15:33:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-17 15:33:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 40. [2022-03-17 15:33:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.6) internal successors, (56), 35 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2022-03-17 15:33:09,197 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 60 transitions. Word has length 19 [2022-03-17 15:33:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:33:09,197 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 60 transitions. [2022-03-17 15:33:09,198 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.565217391304348) internal successors, (36), 20 states have internal predecessors, (36), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 60 transitions. [2022-03-17 15:33:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:33:09,198 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:33:09,198 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:33:09,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-17 15:33:09,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-17 15:33:09,403 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:33:09,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:33:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash 569378245, now seen corresponding path program 2 times [2022-03-17 15:33:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:33:09,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144002905] [2022-03-17 15:33:09,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:33:09,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:33:09,408 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:09,409 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:09,410 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-17 15:33:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:09,420 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-17 15:33:09,423 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:09,425 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_12 .cse0 (* (- 4294967296) (div (+ main_~z~0_12 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:09,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:33:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:09,549 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-17 15:33:09,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:33:09,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144002905] [2022-03-17 15:33:09,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144002905] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:33:09,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138439142] [2022-03-17 15:33:09,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:33:09,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:33:09,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:33:09,551 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:33:09,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-17 15:33:09,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:33:09,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:33:09,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 15:33:09,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:33:09,663 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-17 15:33:09,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:33:59,718 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (>= aux_mod_v_main_~y~0_54_31 4294967296) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (or (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_54_31) c_main_~y~0 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0))))) (forall ((aux_mod_v_main_~z~0_45_31 Int) (aux_div_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0) (and (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~z~0_45_31 v_it_5 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ c_main_~y~0 c_main_~z~0)) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~z~0_45_31 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296)) (+ c_main_~y~0 c_main_~z~0))))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_mod_v_main_~z~0_45_31 2) (* 4294967295 c_main_~z~0)) 4294967296))) (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_55_70 4294967296))) (or (<= aux_mod_v_main_~y~0_55_70 0) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1 (* 4294967295 c_main_~z~0)) (+ (* aux_div_v_main_~y~0_55_70 4294967296) (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0))))) (<= (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0)) (+ .cse0 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70)) (<= 4294967296 aux_mod_v_main_~y~0_55_70) (<= (+ .cse0 (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294)) (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) (* 4294967295 c_main_~z~0)))))))))) (not .cse1)) (or .cse1 (not (< 0 (mod c_main_~z~0 4294967296))) (and (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse2 (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70))) (or (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse2) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70)) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= .cse2 (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296))) (<= aux_mod_v_main_~y~0_55_70 0) (<= 4294967296 aux_mod_v_main_~y~0_55_70)))) (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0) 4294967296))))))))) is different from true [2022-03-17 15:34:23,072 WARN L855 $PredicateComparison]: unable to prove that (or (not (< 0 (mod c_main_~y~0 4294967296))) (< 0 (mod c_main_~z~0 4294967296)) (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (and (or (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_54_31) c_main_~y~0 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0))))) (forall ((aux_mod_v_main_~z~0_45_31 Int) (aux_div_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0) (and (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~z~0_45_31 v_it_5 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ c_main_~y~0 c_main_~z~0)) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~z~0_45_31 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296)) (+ c_main_~y~0 c_main_~z~0))))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_mod_v_main_~z~0_45_31 2) (* 4294967295 c_main_~z~0)) 4294967296))) (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_55_70 4294967296))) (or (<= aux_mod_v_main_~y~0_55_70 0) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1 (* 4294967295 c_main_~z~0)) (+ (* aux_div_v_main_~y~0_55_70 4294967296) (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0))))) (<= (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0)) (+ .cse0 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70)) (<= 4294967296 aux_mod_v_main_~y~0_55_70) (<= (+ .cse0 (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294)) (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) (* 4294967295 c_main_~z~0)))))))))) (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (>= aux_mod_v_main_~y~0_54_31 4294967296)))) is different from true [2022-03-17 15:34:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:34:23,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138439142] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:34:23,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:34:23,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 9] total 15 [2022-03-17 15:34:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823398826] [2022-03-17 15:34:23,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:34:23,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-17 15:34:23,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:34:23,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-17 15:34:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=120, Unknown=7, NotChecked=46, Total=210 [2022-03-17 15:34:23,088 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:34:43,685 WARN L232 SmtUtils]: Spent 14.23s 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-17 15:34:45,707 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (forall ((aux_mod_v_main_~y~0_54_31 Int)) (or (= aux_mod_v_main_~y~0_54_31 0) (> 0 aux_mod_v_main_~y~0_54_31) (>= aux_mod_v_main_~y~0_54_31 4294967296) (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (or (< 0 (mod (+ (* 4294967295 aux_mod_v_main_~y~0_54_31) c_main_~y~0 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0))))) (forall ((aux_mod_v_main_~z~0_45_31 Int) (aux_div_v_main_~z~0_45_31 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_45_31) (<= aux_mod_v_main_~z~0_45_31 0) (exists ((v_it_3 Int)) (and (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31))) (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_45_31 (* 4294967296 aux_div_v_main_~z~0_45_31)) c_main_~z~0) (and (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ aux_mod_v_main_~z~0_45_31 v_it_5 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ c_main_~y~0 c_main_~z~0)) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~z~0_45_31 aux_mod_v_main_~y~0_54_31 (* 4294967296 aux_div_v_main_~z~0_45_31) (* aux_div_v_main_~y~0_54_31 4294967296)) (+ c_main_~y~0 c_main_~z~0))))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_mod_v_main_~z~0_45_31 2) (* 4294967295 c_main_~z~0)) 4294967296))) (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse0 (* aux_div_v_main_~y~0_55_70 4294967296))) (or (<= aux_mod_v_main_~y~0_55_70 0) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1 (* 4294967295 c_main_~z~0)) (+ (* aux_div_v_main_~y~0_55_70 4294967296) (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294))) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~z~0_45_31 (* v_it_5 4294967295)) 4294967296))) (<= 1 v_it_5) (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0))))) (<= (+ (* 4294967296 c_main_~z~0) (* 4294967296 c_main_~y~0)) (+ .cse0 (* 18446744069414584320 aux_div_v_main_~z~0_45_31) (* aux_mod_v_main_~z~0_45_31 4294967295) aux_mod_v_main_~y~0_55_70)) (<= 4294967296 aux_mod_v_main_~y~0_55_70) (<= (+ .cse0 (* 18446744065119617024 aux_div_v_main_~z~0_45_31) aux_mod_v_main_~y~0_55_70 (* aux_mod_v_main_~z~0_45_31 4294967294)) (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) (* 4294967295 c_main_~z~0)))))))))) (not .cse1)) (or .cse1 (not (< 0 (mod c_main_~z~0 4294967296))) (and (forall ((aux_div_v_main_~y~0_55_70 Int) (aux_mod_v_main_~y~0_55_70 Int) (aux_div_v_main_~y~0_54_31 Int)) (let ((.cse2 (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70))) (or (<= (+ (* 4294967296 c_main_~y~0) c_main_~z~0) .cse2) (exists ((v_it_5 Int)) (and (<= (+ v_it_5 (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_55_70 4294967296) aux_mod_v_main_~y~0_55_70)) (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~y~0_55_70 (* v_it_5 4294967295)) 4294967296))))) (exists ((v_it_5 Int)) (and (<= (+ (* aux_div_v_main_~y~0_55_70 4294967296) v_it_5 aux_mod_v_main_~y~0_55_70 1) (+ (* 4294967296 c_main_~y~0) c_main_~z~0)) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (<= .cse2 (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0 (* aux_div_v_main_~y~0_54_31 4294967296))) (<= aux_mod_v_main_~y~0_55_70 0) (<= 4294967296 aux_mod_v_main_~y~0_55_70)))) (or (forall ((aux_div_v_main_~y~0_54_31 Int)) (or (exists ((v_it_5 Int)) (and (<= (+ v_it_5 aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5))) (not (< (+ aux_mod_v_main_~y~0_54_31 (* aux_div_v_main_~y~0_54_31 4294967296)) c_main_~y~0)))) (< 0 (mod (+ (* 4294967295 c_main_~y~0) aux_mod_v_main_~y~0_54_31 c_main_~z~0) 4294967296))))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-17 15:34:59,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:34:59,389 INFO L93 Difference]: Finished difference Result 56 states and 80 transitions. [2022-03-17 15:34:59,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-17 15:34:59,389 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:34:59,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:34:59,390 INFO L225 Difference]: With dead ends: 56 [2022-03-17 15:34:59,390 INFO L226 Difference]: Without dead ends: 49 [2022-03-17 15:34:59,390 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=88, Invalid=288, Unknown=16, NotChecked=114, Total=506 [2022-03-17 15:34:59,390 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:34:59,391 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2022-03-17 15:34:59,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-03-17 15:34:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 41. [2022-03-17 15:34:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.5833333333333333) internal successors, (57), 36 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:34:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 61 transitions. [2022-03-17 15:34:59,395 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 61 transitions. Word has length 19 [2022-03-17 15:34:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:34:59,395 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 61 transitions. [2022-03-17 15:34:59,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.0) internal successors, (30), 12 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:34:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 61 transitions. [2022-03-17 15:34:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:34:59,395 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:34:59,396 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:34:59,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-03-17 15:34:59,603 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-17 15:34:59,603 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:34:59,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:34:59,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1237826144, now seen corresponding path program 1 times [2022-03-17 15:34:59,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:34:59,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487947699] [2022-03-17 15:34:59,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:34:59,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:34:59,608 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:34:59,609 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:34:59,610 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-17 15:34:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:34:59,619 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-17 15:34:59,622 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:34:59,624 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-17 15:34:59,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:34:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:34:59,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:34:59,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:34:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487947699] [2022-03-17 15:34:59,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487947699] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:34:59,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276160536] [2022-03-17 15:34:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:34:59,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:34:59,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:34:59,820 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:34:59,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-17 15:34:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:34:59,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:34:59,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:35:00,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:35:00,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:35:51,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((v_main_~y~0_61 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61))) (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) v_main_~y~0_61))))))) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse2 (not (= v_main_~y~0_61 c_main_~y~0))) (or (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_61) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< c_main_~y~0 v_main_~y~0_61)) (not .cse2))))))) (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse6 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse5 (< 0 (mod c_main_~x~0 4294967296))) (.cse4 (+ c_main_~y~0 c_main_~z~0)) (.cse3 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse6))) (and (or (not (= .cse3 .cse4)) .cse5) (or (not .cse5) (not (< .cse4 .cse3)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse6) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse7 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse7) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse7)))))) (not .cse0)))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31))) is different from false [2022-03-17 15:35:53,847 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((v_main_~y~0_61 Int)) (or (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61))) (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) v_main_~y~0_61))))))) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse2 (not (= v_main_~y~0_61 c_main_~y~0))) (or (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_61) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< c_main_~y~0 v_main_~y~0_61)) (not .cse2))))))) (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse6 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse5 (< 0 (mod c_main_~x~0 4294967296))) (.cse4 (+ c_main_~y~0 c_main_~z~0)) (.cse3 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse6))) (and (or (not (= .cse3 .cse4)) .cse5) (or (not .cse5) (not (< .cse4 .cse3)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse6) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse7 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse7) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse7)))))) (not .cse0)))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31))) is different from true [2022-03-17 15:36:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:36:30,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276160536] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:36:30,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:36:30,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 18 [2022-03-17 15:36:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302536845] [2022-03-17 15:36:30,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:36:30,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 15:36:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:36:30,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 15:36:30,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=208, Unknown=12, NotChecked=30, Total=306 [2022-03-17 15:36:30,310 INFO L87 Difference]: Start difference. First operand 41 states and 61 transitions. Second operand has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:36:46,778 WARN L232 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 117 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:36:48,791 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (or (< 0 (mod c_main_~y~0 4294967296)) (<= (mod c_main_~x~0 4294967296) 0)) (or (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31) (let ((.cse5 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse3 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse2 (< 0 (mod c_main_~x~0 4294967296))) (.cse1 (+ c_main_~y~0 c_main_~z~0)) (.cse0 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse3))) (and (or (not (= .cse0 .cse1)) .cse2) (or (not .cse2) (not (< .cse1 .cse0)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse3) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse4 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse4) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse4)))))) (not .cse5)) (or .cse5 (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))))))))) (< 0 (mod c_main_~z~0 4294967296))) (forall ((aux_mod_v_main_~y~0_60_31 Int)) (or (= aux_mod_v_main_~y~0_60_31 0) (let ((.cse6 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse6 (forall ((v_main_~y~0_61 Int)) (or (let ((.cse7 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)))) .cse7) (or (not .cse7) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61))) (not (< (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) v_main_~y~0_61))))))) (let ((.cse8 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse8 (not (= v_main_~y~0_61 c_main_~y~0))) (or (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_61) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))) (not (< c_main_~y~0 v_main_~y~0_61)) (not .cse8))))))) (or (and (forall ((v_main_~y~0_61 Int) (aux_div_v_main_~y~0_60_31 Int) (aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (let ((.cse12 (* 4294967296 aux_div_v_main_~z~0_50_31))) (or (<= 4294967296 aux_mod_v_main_~z~0_50_31) (let ((.cse11 (< 0 (mod c_main_~x~0 4294967296))) (.cse10 (+ c_main_~y~0 c_main_~z~0)) (.cse9 (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 .cse12))) (and (or (not (= .cse9 .cse10)) .cse11) (or (not .cse11) (not (< .cse10 .cse9)) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ v_main_~y~0_61 aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (<= aux_mod_v_main_~z~0_50_31 0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= v_main_~y~0_61 (+ (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= (+ aux_mod_v_main_~z~0_50_31 .cse12) c_main_~z~0) (exists ((v_it_5 Int)) (and (<= 1 v_it_5) (not (< 0 (mod (+ aux_mod_v_main_~z~0_50_31 (* v_it_5 4294967295)) 4294967296))) (<= (+ v_it_5 (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31 1) v_main_~y~0_61)))))) (forall ((aux_mod_v_main_~z~0_50_31 Int) (aux_div_v_main_~z~0_50_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31))) (<= 1 v_it_3))) (<= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31)) c_main_~z~0) (< aux_mod_v_main_~z~0_50_31 0) (< 0 aux_mod_v_main_~z~0_50_31) (let ((.cse13 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse13) (forall ((aux_div_v_main_~y~0_60_31 Int)) (or (not (< (+ c_main_~y~0 c_main_~z~0) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31)) (<= 1 v_it_4)))))) (or (forall ((aux_div_v_main_~y~0_60_31 Int)) (not (= (+ aux_mod_v_main_~z~0_50_31 (* 4294967296 aux_div_v_main_~z~0_50_31) (* aux_div_v_main_~y~0_60_31 4294967296) aux_mod_v_main_~y~0_60_31) (+ c_main_~y~0 c_main_~z~0)))) .cse13)))))) (not .cse6)))) (>= aux_mod_v_main_~y~0_60_31 4294967296) (> 0 aux_mod_v_main_~y~0_60_31))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-17 15:37:14,077 WARN L232 SmtUtils]: Spent 11.06s on a formula simplification. DAG size of input: 147 DAG size of output: 72 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:37:39,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:37:39,067 INFO L93 Difference]: Finished difference Result 60 states and 85 transitions. [2022-03-17 15:37:39,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-17 15:37:39,068 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:37:39,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:37:39,068 INFO L225 Difference]: With dead ends: 60 [2022-03-17 15:37:39,068 INFO L226 Difference]: Without dead ends: 56 [2022-03-17 15:37:39,069 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 116.4s TimeCoverageRelationStatistics Valid=164, Invalid=626, Unknown=30, NotChecked=110, Total=930 [2022-03-17 15:37:39,069 INFO L912 BasicCegarLoop]: 16 mSDtfsCounter, 41 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:37:39,069 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 81 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 70 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2022-03-17 15:37:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-03-17 15:37:39,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2022-03-17 15:37:39,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:37:39,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2022-03-17 15:37:39,074 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 19 [2022-03-17 15:37:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:37:39,074 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2022-03-17 15:37:39,074 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 15 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:37:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2022-03-17 15:37:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:37:39,075 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:37:39,075 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:37:39,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-17 15:37:39,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-17 15:37:39,279 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:37:39,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:37:39,280 INFO L85 PathProgramCache]: Analyzing trace with hash -464839067, now seen corresponding path program 2 times [2022-03-17 15:37:39,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:37:39,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718192254] [2022-03-17 15:37:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:37:39,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:37:39,283 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:37:39,284 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:37:39,284 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-03-17 15:37:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:37:39,294 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-17 15:37:39,296 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:37:39,298 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-03-17 15:37:39,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:37:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:37:39,494 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-17 15:37:39,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:37:39,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718192254] [2022-03-17 15:37:39,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718192254] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:37:39,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716254004] [2022-03-17 15:37:39,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:37:39,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:37:39,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:37:39,496 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:37:39,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-17 15:37:39,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:37:39,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:37:39,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:37:39,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:37:39,768 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-17 15:37:39,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:38:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:38:32,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716254004] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:38:32,617 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:38:32,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 16 [2022-03-17 15:38:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14394620] [2022-03-17 15:38:32,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:38:32,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-17 15:38:32,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:38:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-17 15:38:32,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=181, Unknown=11, NotChecked=0, Total=240 [2022-03-17 15:38:32,619 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:38:39,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:38:39,300 INFO L93 Difference]: Finished difference Result 63 states and 92 transitions. [2022-03-17 15:38:39,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 15:38:39,301 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:38:39,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:38:39,301 INFO L225 Difference]: With dead ends: 63 [2022-03-17 15:38:39,301 INFO L226 Difference]: Without dead ends: 59 [2022-03-17 15:38:39,302 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=104, Invalid=388, Unknown=14, NotChecked=0, Total=506 [2022-03-17 15:38:39,302 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 49 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:38:39,302 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 91 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 97 Invalid, 0 Unknown, 47 Unchecked, 0.1s Time] [2022-03-17 15:38:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-17 15:38:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2022-03-17 15:38:39,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:38:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 64 transitions. [2022-03-17 15:38:39,305 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 64 transitions. Word has length 19 [2022-03-17 15:38:39,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:38:39,306 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 64 transitions. [2022-03-17 15:38:39,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 13 states have internal predecessors, (35), 3 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:38:39,306 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 64 transitions. [2022-03-17 15:38:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:38:39,306 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:38:39,306 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:38:39,323 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-17 15:38:39,511 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-17 15:38:39,511 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:38:39,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:38:39,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2046243813, now seen corresponding path program 1 times [2022-03-17 15:38:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:38:39,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959339028] [2022-03-17 15:38:39,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:38:39,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:38:39,515 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:39,516 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-17 15:38:39,517 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:38:39,532 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-17 15:38:39,535 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-17 15:38:39,537 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:38:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:38:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:38:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:38:39,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:38:39,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959339028] [2022-03-17 15:38:39,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959339028] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:38:39,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937584527] [2022-03-17 15:38:39,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:38:39,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:38:39,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:38:39,760 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-17 15:38:39,773 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-17 15:38:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:38:39,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:38:39,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:38:39,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:38:39,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:38:45,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~y~0_70_31 Int) (v_main_~y~0_71 Int)) (or (> 0 aux_mod_v_main_~y~0_70_31) (= aux_mod_v_main_~y~0_70_31 0) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (not (= v_main_~y~0_71 c_main_~y~0))) (or (not (< c_main_~y~0 v_main_~y~0_71)) (not .cse0) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_71) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4)))))) (let ((.cse1 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_70_31 Int)) (not (= v_main_~y~0_71 (+ aux_mod_v_main_~y~0_70_31 (* aux_div_v_main_~y~0_70_31 4294967296))))) .cse1) (or (not .cse1) (forall ((aux_div_v_main_~y~0_70_31 Int)) (or (not (< (+ aux_mod_v_main_~y~0_70_31 (* aux_div_v_main_~y~0_70_31 4294967296)) v_main_~y~0_71)) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= (+ v_it_5 aux_mod_v_main_~y~0_70_31 (* aux_div_v_main_~y~0_70_31 4294967296) 1) v_main_~y~0_71) (<= 1 v_it_5)))))))) (>= aux_mod_v_main_~y~0_70_31 4294967296))) is different from false [2022-03-17 15:38:59,111 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:38:59,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937584527] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:38:59,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:38:59,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 11] total 20 [2022-03-17 15:38:59,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564422334] [2022-03-17 15:38:59,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:38:59,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:38:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:38:59,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:38:59,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=270, Unknown=6, NotChecked=34, Total=380 [2022-03-17 15:38:59,112 INFO L87 Difference]: Start difference. First operand 43 states and 64 transitions. Second operand has 20 states, 20 states have (on average 1.6) internal successors, (32), 17 states have internal predecessors, (32), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)