/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-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7968f31 [2022-03-17 15:25:25,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-17 15:25:25,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-17 15:25:25,640 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-17 15:25:25,640 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-17 15:25:25,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-17 15:25:25,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-17 15:25:25,643 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-17 15:25:25,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-17 15:25:25,645 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-17 15:25:25,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-17 15:25:25,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-17 15:25:25,647 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-17 15:25:25,648 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-17 15:25:25,649 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-17 15:25:25,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-17 15:25:25,650 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-17 15:25:25,651 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-17 15:25:25,652 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-17 15:25:25,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-17 15:25:25,655 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-17 15:25:25,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-17 15:25:25,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-17 15:25:25,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-17 15:25:25,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-17 15:25:25,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-17 15:25:25,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-17 15:25:25,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-17 15:25:25,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-17 15:25:25,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-17 15:25:25,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-17 15:25:25,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-17 15:25:25,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-17 15:25:25,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-17 15:25:25,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-17 15:25:25,666 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-17 15:25:25,666 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-17 15:25:25,667 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-17 15:25:25,667 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-17 15:25:25,667 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-17 15:25:25,668 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-17 15:25:25,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-17 15:25:25,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-17 15:25:25,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-17 15:25:25,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-17 15:25:25,678 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-17 15:25:25,678 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-17 15:25:25,678 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-17 15:25:25,679 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-17 15:25:25,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-17 15:25:25,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-17 15:25:25,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-17 15:25:25,680 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-17 15:25:25,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-17 15:25:25,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:25:25,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-17 15:25:25,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-17 15:25:25,681 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-17 15:25:25,681 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:25:25,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-17 15:25:25,868 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-17 15:25:25,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-17 15:25:25,871 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-17 15:25:25,871 INFO L275 PluginConnector]: CDTParser initialized [2022-03-17 15:25:25,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-03-17 15:25:25,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476cd95da/1aafed913cc3403aa12ceb80f445c20f/FLAG204a5dc3f [2022-03-17 15:25:26,257 INFO L306 CDTParser]: Found 1 translation units. [2022-03-17 15:25:26,258 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-03-17 15:25:26,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476cd95da/1aafed913cc3403aa12ceb80f445c20f/FLAG204a5dc3f [2022-03-17 15:25:26,271 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/476cd95da/1aafed913cc3403aa12ceb80f445c20f [2022-03-17 15:25:26,273 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-17 15:25:26,275 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-17 15:25:26,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-17 15:25:26,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-17 15:25:26,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-17 15:25:26,279 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11531d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26, skipping insertion in model container [2022-03-17 15:25:26,280 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,289 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-17 15:25:26,304 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-17 15:25:26,502 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-de61.c[368,381] [2022-03-17 15:25:26,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:25:26,527 INFO L203 MainTranslator]: Completed pre-run [2022-03-17 15:25:26,538 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-de61.c[368,381] [2022-03-17 15:25:26,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-17 15:25:26,562 INFO L208 MainTranslator]: Completed translation [2022-03-17 15:25:26,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26 WrapperNode [2022-03-17 15:25:26,563 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-17 15:25:26,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-17 15:25:26,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-17 15:25:26,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-17 15:25:26,575 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,591 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,596 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-17 15:25:26,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-17 15:25:26,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-17 15:25:26,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-17 15:25:26,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:26,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-17 15:25:26,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:26,636 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:25:26,648 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:25:26,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-17 15:25:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-17 15:25:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-17 15:25:26,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-17 15:25:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-17 15:25:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-17 15:25:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-17 15:25:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-17 15:25:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-17 15:25:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-17 15:25:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-17 15:25:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-17 15:25:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-17 15:25:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-17 15:25:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-17 15:25:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-17 15:25:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-17 15:25:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-17 15:25:26,738 INFO L234 CfgBuilder]: Building ICFG [2022-03-17 15:25:26,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-17 15:25:26,831 INFO L275 CfgBuilder]: Performing block encoding [2022-03-17 15:25:26,836 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-17 15:25:26,836 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-17 15:25:26,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:25:26 BoogieIcfgContainer [2022-03-17 15:25:26,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-17 15:25:26,838 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-17 15:25:26,838 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-17 15:25:26,839 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-17 15:25:26,841 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:25:26" (1/1) ... [2022-03-17 15:25:27,063 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:25:27,064 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 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_9} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~y~0_9 v_main_~y~0_8) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0)) (and (= v_main_~x~0_3 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_4 v_main_~y~0_9)) (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_9 v_it_1 1) v_main_~y~0_8)))) (< 0 .cse0) (< v_main_~y~0_9 v_main_~y~0_8)))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_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:25:27,198 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:25:27,199 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, 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_11 4294967296))) (or (and (< v_main_~z~0_10 v_main_~z~0_11) (= v_main_~x~0_8 (+ v_main_~z~0_11 v_main_~x~0_9 (* (- 1) v_main_~z~0_10))) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_10 v_it_2 1) v_main_~z~0_11)) (< 0 (mod (+ v_main_~z~0_11 (* v_it_2 4294967295)) 4294967296))))) (and (= v_main_~x~0_9 v_main_~x~0_8) (= v_main_~z~0_11 v_main_~z~0_10) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (<= .cse0 0) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, 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_10, 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:25:27,262 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:25:27,262 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_4, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|) (<= .cse0 0)) (and (= v_main_~y~0_4 (+ v_main_~y~0_5 v_main_~z~0_3 (* (- 1) v_main_~z~0_2))) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= (+ v_main_~z~0_3 v_it_3 1) v_main_~z~0_2)) (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_5 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-03-17 15:25:27,344 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-17 15:25:27,344 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_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_10, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_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_~y~0_10 (+ (* (- 1) v_main_~x~0_6) v_main_~y~0_11 v_main_~x~0_7)) (< v_main_~x~0_6 v_main_~x~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_11 v_main_~y~0_10) (= v_main_~x~0_7 v_main_~x~0_6)))) InVars {main_~y~0=v_main_~y~0_11, 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_10, 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:25:27,408 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:25:27,409 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_13 4294967296))) (or (and (= v_main_~z~0_12 (+ v_main_~x~0_11 v_main_~z~0_13 (* (- 1) v_main_~x~0_10))) (< v_main_~x~0_11 v_main_~x~0_10) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~z~0_13 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_11 v_it_5 1) v_main_~x~0_10)))) (< 0 .cse0)) (and (= v_main_~x~0_11 v_main_~x~0_10) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (<= .cse0 0) (= v_main_~z~0_13 v_main_~z~0_12) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-03-17 15:25:27,468 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:25:27,468 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~z~0=v_main_~z~0_5, main_~y~0=v_main_~y~0_7} OutVars{main_~z~0=v_main_~z~0_4, main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_7 4294967296))) (or (and (= |v_main_#t~post15_3| |v_main_#t~post15_1|) (= |v_main_#t~post16_3| |v_main_#t~post16_1|) (= v_main_~y~0_7 v_main_~y~0_6) (= v_main_~z~0_5 v_main_~z~0_4) (<= .cse0 0)) (and (< 0 .cse0) (< v_main_~z~0_5 v_main_~z~0_4) (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_main_~z~0_5 v_it_6 1) v_main_~z~0_4)) (< 0 (mod (+ v_main_~y~0_7 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~y~0_6 (+ (* (- 1) v_main_~z~0_4) v_main_~y~0_7 v_main_~z~0_5))))) InVars {main_#t~post15=|v_main_#t~post15_3|, main_~y~0=v_main_~y~0_7, main_#t~post16=|v_main_#t~post16_3|, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] [2022-03-17 15:25:27,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:25:27 BasicIcfg [2022-03-17 15:25:27,472 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-17 15:25:27,474 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-17 15:25:27,474 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-17 15:25:27,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-17 15:25:27,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:25:26" (1/4) ... [2022-03-17 15:25:27,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e60fbbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:27, skipping insertion in model container [2022-03-17 15:25:27,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:25:26" (2/4) ... [2022-03-17 15:25:27,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e60fbbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:25:27, skipping insertion in model container [2022-03-17 15:25:27,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.03 03:25:26" (3/4) ... [2022-03-17 15:25:27,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e60fbbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:25:27, skipping insertion in model container [2022-03-17 15:25:27,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 17.03 03:25:27" (4/4) ... [2022-03-17 15:25:27,480 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.cJordan [2022-03-17 15:25:27,486 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-17 15:25:27,486 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-17 15:25:27,514 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-17 15:25:27,518 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:25:27,518 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-17 15:25:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-17 15:25:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:25:27,532 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:27,532 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:27,533 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:27,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-03-17 15:25:27,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:27,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568041831] [2022-03-17 15:25:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:27,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:27,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:27,679 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:25:27,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:27,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568041831] [2022-03-17 15:25:27,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568041831] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:27,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:25:27,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-17 15:25:27,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774176166] [2022-03-17 15:25:27,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:27,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-17 15:25:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:27,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-17 15:25:27,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-17 15:25:27,708 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:27,737 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-03-17 15:25:27,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-17 15:25:27,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-17 15:25:27,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:27,744 INFO L225 Difference]: With dead ends: 25 [2022-03-17 15:25:27,744 INFO L226 Difference]: Without dead ends: 18 [2022-03-17 15:25:27,763 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:25:27,768 INFO L912 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:27,769 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-17 15:25:27,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-17 15:25:27,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-17 15:25:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:27,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-03-17 15:25:27,796 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-03-17 15:25:27,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:27,796 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-03-17 15:25:27,796 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:27,797 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-03-17 15:25:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-17 15:25:27,797 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:27,798 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:27,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-17 15:25:27,799 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:27,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:27,803 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-03-17 15:25:27,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:27,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012526975] [2022-03-17 15:25:27,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:28,167 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:25:28,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:28,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012526975] [2022-03-17 15:25:28,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012526975] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:28,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-17 15:25:28,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-17 15:25:28,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411216766] [2022-03-17 15:25:28,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:28,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-17 15:25:28,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:28,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-17 15:25:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-17 15:25:28,175 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:28,331 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2022-03-17 15:25:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-17 15:25:28,332 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-17 15:25:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:28,334 INFO L225 Difference]: With dead ends: 33 [2022-03-17 15:25:28,334 INFO L226 Difference]: Without dead ends: 30 [2022-03-17 15:25:28,337 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-03-17 15:25:28,338 INFO L912 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:28,341 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 6 Unchecked, 0.1s Time] [2022-03-17 15:25:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-17 15:25:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-03-17 15:25:28,351 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:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-17 15:25:28,352 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 17 [2022-03-17 15:25:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:28,352 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-17 15:25:28,352 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:28,352 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-17 15:25:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:28,353 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:28,353 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:28,353 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-17 15:25:28,353 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:28,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash 34479891, now seen corresponding path program 1 times [2022-03-17 15:25:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:28,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119863831] [2022-03-17 15:25:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:28,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:28,373 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:25:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:28,417 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:28,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:28,614 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:28,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:28,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119863831] [2022-03-17 15:25:28,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119863831] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:28,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613405214] [2022-03-17 15:25:28,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:28,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:28,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:28,627 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:25:28,643 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:25:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:28,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:25:28,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:28,859 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:25:28,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613405214] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:28,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:25:28,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-17 15:25:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162769230] [2022-03-17 15:25:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:28,861 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:25:28,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:25:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:25:28,862 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:28,921 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-03-17 15:25:28,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:25:28,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:25:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:28,924 INFO L225 Difference]: With dead ends: 32 [2022-03-17 15:25:28,924 INFO L226 Difference]: Without dead ends: 29 [2022-03-17 15:25:28,925 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:25:28,927 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:28,928 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 76 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:25:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-17 15:25:28,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-03-17 15:25:28,936 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:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-17 15:25:28,938 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-03-17 15:25:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:28,939 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-17 15:25:28,939 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-17 15:25:28,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:28,940 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:28,940 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:28,970 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:29,162 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:29,162 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:29,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:29,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-03-17 15:25:29,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:29,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327951372] [2022-03-17 15:25:29,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:29,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:29,170 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:29,213 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:29,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:29,370 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:29,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:29,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327951372] [2022-03-17 15:25:29,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327951372] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:29,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646655444] [2022-03-17 15:25:29,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:29,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:29,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:29,372 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:29,398 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:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:29,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:25:29,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:29,635 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:29,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:25:34,529 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:34,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646655444] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:34,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:34,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-03-17 15:25:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485093123] [2022-03-17 15:25:34,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:34,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:25:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:34,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:25:34,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=297, Unknown=1, NotChecked=0, Total=380 [2022-03-17 15:25:34,532 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:34,711 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2022-03-17 15:25:34,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 15:25:34,711 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:25:34,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:34,712 INFO L225 Difference]: With dead ends: 38 [2022-03-17 15:25:34,712 INFO L226 Difference]: Without dead ends: 35 [2022-03-17 15:25:34,712 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=140, Invalid=509, Unknown=1, NotChecked=0, Total=650 [2022-03-17 15:25:34,713 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:34,713 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 72 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-03-17 15:25:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-17 15:25:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-03-17 15:25:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-03-17 15:25:34,717 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 18 [2022-03-17 15:25:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:34,717 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-03-17 15:25:34,717 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:34,718 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-03-17 15:25:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:34,718 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:34,718 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:34,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-17 15:25:34,927 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:34,928 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:34,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:34,928 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-03-17 15:25:34,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:34,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253534918] [2022-03-17 15:25:34,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:34,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:34,934 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:34,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:34,949 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:35,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:35,056 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:35,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:35,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253534918] [2022-03-17 15:25:35,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253534918] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:35,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121159616] [2022-03-17 15:25:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:35,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:35,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:35,058 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:35,091 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:35,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:35,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:25:35,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:35,216 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:25:35,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121159616] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:35,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:25:35,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-17 15:25:35,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237481221] [2022-03-17 15:25:35,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:35,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:25:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:35,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:25:35,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:25:35,218 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:35,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:35,258 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-03-17 15:25:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:25:35,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:25:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:35,261 INFO L225 Difference]: With dead ends: 34 [2022-03-17 15:25:35,261 INFO L226 Difference]: Without dead ends: 31 [2022-03-17 15:25:35,261 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:25:35,262 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:35,262 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:25:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-17 15:25:35,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-03-17 15:25:35,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 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:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-03-17 15:25:35,271 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 18 [2022-03-17 15:25:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:35,271 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2022-03-17 15:25:35,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2022-03-17 15:25:35,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:35,272 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:35,272 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:35,298 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:25:35,487 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:25:35,488 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:35,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:35,488 INFO L85 PathProgramCache]: Analyzing trace with hash 223241102, now seen corresponding path program 1 times [2022-03-17 15:25:35,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:35,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267335770] [2022-03-17 15:25:35,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:35,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:35,493 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:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:35,508 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:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:35,623 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:35,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267335770] [2022-03-17 15:25:35,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267335770] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:35,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371093871] [2022-03-17 15:25:35,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:35,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:35,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:35,625 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:25:35,649 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:25:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:35,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:25:35,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:35,840 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:25:35,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371093871] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:35,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:25:35,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-03-17 15:25:35,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811795806] [2022-03-17 15:25:35,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:35,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:25:35,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:35,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:25:35,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:25:35,841 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:35,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:35,875 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-03-17 15:25:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 15:25:35,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:25:35,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:35,877 INFO L225 Difference]: With dead ends: 36 [2022-03-17 15:25:35,877 INFO L226 Difference]: Without dead ends: 33 [2022-03-17 15:25:35,877 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-03-17 15:25:35,879 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:35,879 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:25:35,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-03-17 15:25:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-03-17 15:25:35,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 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:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2022-03-17 15:25:35,885 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 18 [2022-03-17 15:25:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:35,885 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2022-03-17 15:25:35,885 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2022-03-17 15:25:35,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:35,886 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:35,886 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:35,909 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:25:36,099 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:25:36,100 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:36,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:36,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1522150354, now seen corresponding path program 1 times [2022-03-17 15:25:36,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:36,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545733278] [2022-03-17 15:25:36,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:36,105 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:25:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:36,119 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:36,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:36,234 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:36,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:36,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545733278] [2022-03-17 15:25:36,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545733278] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:36,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841278710] [2022-03-17 15:25:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:36,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:36,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:36,236 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:25:36,237 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:25:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:36,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:25:36,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:36,413 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:25:36,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841278710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:36,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:25:36,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-17 15:25:36,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859799807] [2022-03-17 15:25:36,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:36,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:25:36,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:36,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:25:36,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:25:36,415 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:36,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:36,466 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2022-03-17 15:25:36,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:25:36,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:25:36,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:36,467 INFO L225 Difference]: With dead ends: 39 [2022-03-17 15:25:36,467 INFO L226 Difference]: Without dead ends: 36 [2022-03-17 15:25:36,467 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:25:36,468 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:36,468 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:25:36,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-17 15:25:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-03-17 15:25:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 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:25:36,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-03-17 15:25:36,470 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 18 [2022-03-17 15:25:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:36,471 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-03-17 15:25:36,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2022-03-17 15:25:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-17 15:25:36,471 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:36,471 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:25:36,495 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:25:36,672 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:36,672 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:36,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:36,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1504591698, now seen corresponding path program 1 times [2022-03-17 15:25:36,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:36,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160709551] [2022-03-17 15:25:36,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:36,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:36,677 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:36,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:36,689 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:36,858 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:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:36,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160709551] [2022-03-17 15:25:36,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160709551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:36,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982812313] [2022-03-17 15:25:36,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:36,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:36,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:36,860 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:25:36,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-17 15:25:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:36,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-17 15:25:36,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:37,266 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:37,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:25:37,729 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:37,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982812313] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:37,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:37,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-03-17 15:25:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327877726] [2022-03-17 15:25:37,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:37,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-17 15:25:37,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-17 15:25:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:25:37,731 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:40,072 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2022-03-17 15:25:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 15:25:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-17 15:25:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:40,073 INFO L225 Difference]: With dead ends: 49 [2022-03-17 15:25:40,073 INFO L226 Difference]: Without dead ends: 46 [2022-03-17 15:25:40,073 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=127, Invalid=472, Unknown=1, NotChecked=0, Total=600 [2022-03-17 15:25:40,074 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:40,074 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 73 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-03-17 15:25:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-17 15:25:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-03-17 15:25:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 31 states have internal predecessors, (51), 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:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2022-03-17 15:25:40,077 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 55 transitions. Word has length 18 [2022-03-17 15:25:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:40,077 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 55 transitions. [2022-03-17 15:25:40,078 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2022-03-17 15:25:40,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:25:40,078 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:40,078 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:25:40,103 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:25:40,279 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:25:40,279 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:40,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1095597292, now seen corresponding path program 1 times [2022-03-17 15:25:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:40,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250075625] [2022-03-17 15:25:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:40,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:40,285 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:25:40,286 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:40,315 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:25:40,319 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:40,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:40,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250075625] [2022-03-17 15:25:40,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250075625] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210500379] [2022-03-17 15:25:40,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:40,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:40,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:40,480 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:25:40,491 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:25:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:40,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:25:40,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:40,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:25:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:25:44,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210500379] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:25:44,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:25:44,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-03-17 15:25:44,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338458780] [2022-03-17 15:25:44,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:25:44,592 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-17 15:25:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-17 15:25:44,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=394, Unknown=1, NotChecked=0, Total=506 [2022-03-17 15:25:44,593 INFO L87 Difference]: Start difference. First operand 36 states and 55 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:44,878 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2022-03-17 15:25:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-17 15:25:44,878 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:25:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:44,879 INFO L225 Difference]: With dead ends: 55 [2022-03-17 15:25:44,879 INFO L226 Difference]: Without dead ends: 51 [2022-03-17 15:25:44,879 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=233, Invalid=822, Unknown=1, NotChecked=0, Total=1056 [2022-03-17 15:25:44,880 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:44,880 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 89 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 129 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-03-17 15:25:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-17 15:25:44,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-03-17 15:25:44,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 33 states have internal predecessors, (55), 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:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2022-03-17 15:25:44,883 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 19 [2022-03-17 15:25:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:44,883 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2022-03-17 15:25:44,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2022-03-17 15:25:44,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:25:44,884 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:44,884 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:25:44,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-17 15:25:45,087 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:25:45,088 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-03-17 15:25:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:45,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913867446] [2022-03-17 15:25:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:45,093 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:25:45,094 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:25:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:45,111 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:25:45,114 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:25:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:45,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:45,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913867446] [2022-03-17 15:25:45,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913867446] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:45,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522733924] [2022-03-17 15:25:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:45,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:45,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:45,234 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:25:45,234 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:25:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:45,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:25:45,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:45,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:25:45,391 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:25:45,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522733924] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:45,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:25:45,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-03-17 15:25:45,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479654170] [2022-03-17 15:25:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:45,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:25:45,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:25:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-17 15:25:45,392 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:45,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:45,433 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2022-03-17 15:25:45,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:25:45,433 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:25:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:45,434 INFO L225 Difference]: With dead ends: 45 [2022-03-17 15:25:45,434 INFO L226 Difference]: Without dead ends: 42 [2022-03-17 15:25:45,434 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-03-17 15:25:45,435 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:45,435 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 67 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:25:45,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-17 15:25:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-03-17 15:25:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 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:45,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2022-03-17 15:25:45,438 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 19 [2022-03-17 15:25:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:45,438 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2022-03-17 15:25:45,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2022-03-17 15:25:45,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:25:45,438 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:45,438 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:25:45,464 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:25:45,655 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:25:45,655 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:45,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:45,656 INFO L85 PathProgramCache]: Analyzing trace with hash 61379980, now seen corresponding path program 1 times [2022-03-17 15:25:45,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:45,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648672088] [2022-03-17 15:25:45,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:45,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:45,659 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:25:45,660 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:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:45,670 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:25:45,673 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:25:45,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:45,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:25:45,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:45,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648672088] [2022-03-17 15:25:45,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648672088] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:45,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119894507] [2022-03-17 15:25:45,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:45,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:45,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:45,786 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:25:45,787 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:25:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:45,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:25:45,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:45,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:25:45,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:25:45,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119894507] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:25:45,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:25:45,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-03-17 15:25:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469644022] [2022-03-17 15:25:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:25:45,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:25:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:25:45,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:25:45,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-17 15:25:45,965 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:25:46,002 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2022-03-17 15:25:46,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-17 15:25:46,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:25:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:25:46,002 INFO L225 Difference]: With dead ends: 46 [2022-03-17 15:25:46,003 INFO L226 Difference]: Without dead ends: 43 [2022-03-17 15:25:46,003 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:25:46,003 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:25:46,004 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:25:46,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-17 15:25:46,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-03-17 15:25:46,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 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:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2022-03-17 15:25:46,006 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 19 [2022-03-17 15:25:46,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:25:46,006 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-03-17 15:25:46,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:25:46,006 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2022-03-17 15:25:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:25:46,007 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:25:46,007 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:25:46,031 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:25:46,231 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:25:46,231 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:25:46,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:25:46,232 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-03-17 15:25:46,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:25:46,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127899423] [2022-03-17 15:25:46,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:25:46,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:25:46,236 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:46,237 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:46,249 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:46,250 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-17 15:25:46,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:25:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:25:46,365 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:46,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:25:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127899423] [2022-03-17 15:25:46,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127899423] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:25:46,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670602127] [2022-03-17 15:25:46,365 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:25:46,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:25:46,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:25:46,366 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:25:46,367 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:25:46,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:25:46,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:25:46,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:25:46,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:25:46,518 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:46,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:15,210 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:26:15,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670602127] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:15,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:15,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 19 [2022-03-17 15:26:15,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812289013] [2022-03-17 15:26:15,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:15,211 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 15:26:15,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:15,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 15:26:15,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=258, Unknown=13, NotChecked=0, Total=342 [2022-03-17 15:26:15,212 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:15,398 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-03-17 15:26:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-17 15:26:15,399 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:26:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:15,399 INFO L225 Difference]: With dead ends: 50 [2022-03-17 15:26:15,399 INFO L226 Difference]: Without dead ends: 44 [2022-03-17 15:26:15,400 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 25.0s TimeCoverageRelationStatistics Valid=128, Invalid=459, Unknown=13, NotChecked=0, Total=600 [2022-03-17 15:26:15,400 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:15,400 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 69 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-03-17 15:26:15,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-17 15:26:15,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-03-17 15:26:15,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:15,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2022-03-17 15:26:15,403 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 19 [2022-03-17 15:26:15,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:15,403 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-03-17 15:26:15,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:15,403 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2022-03-17 15:26:15,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:26:15,404 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:15,404 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:26:15,423 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:26:15,615 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:26:15,615 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:15,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:15,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-03-17 15:26:15,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:15,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989041718] [2022-03-17 15:26:15,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:15,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:15,620 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:26:15,621 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:15,632 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:15,634 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:15,773 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:15,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:15,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989041718] [2022-03-17 15:26:15,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989041718] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:15,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144495810] [2022-03-17 15:26:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:15,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:15,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:15,775 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:26:15,775 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:26:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:15,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:26:15,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:15,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:15,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:26:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:26:24,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144495810] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:26:24,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:26:24,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-03-17 15:26:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803015443] [2022-03-17 15:26:24,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:26:24,190 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-17 15:26:24,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:26:24,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-17 15:26:24,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=365, Unknown=3, NotChecked=0, Total=462 [2022-03-17 15:26:24,191 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:24,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:26:24,436 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2022-03-17 15:26:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-17 15:26:24,437 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 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:26:24,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:26:24,437 INFO L225 Difference]: With dead ends: 52 [2022-03-17 15:26:24,437 INFO L226 Difference]: Without dead ends: 48 [2022-03-17 15:26:24,438 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=192, Invalid=735, Unknown=3, NotChecked=0, Total=930 [2022-03-17 15:26:24,438 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 34 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:26:24,438 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 65 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 87 Invalid, 0 Unknown, 34 Unchecked, 0.1s Time] [2022-03-17 15:26:24,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-17 15:26:24,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-03-17 15:26:24,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-03-17 15:26:24,444 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 19 [2022-03-17 15:26:24,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:26:24,445 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-03-17 15:26:24,445 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:26:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-03-17 15:26:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:26:24,445 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:26:24,445 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:26:24,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-17 15:26:24,646 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:26:24,646 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:26:24,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:26:24,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-03-17 15:26:24,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:26:24,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273247768] [2022-03-17 15:26:24,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:24,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:26:24,650 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:24,651 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:24,662 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:26:24,666 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:26:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:26:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:24,780 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:24,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:26:24,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273247768] [2022-03-17 15:26:24,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273247768] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:26:24,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960220112] [2022-03-17 15:26:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:26:24,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:26:24,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:26:24,782 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:26:24,784 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:26:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:26:24,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:26:24,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:26:25,006 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:25,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:00,731 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~z~0_38_31 Int)) (or (> 0 aux_mod_v_main_~z~0_38_31) (= aux_mod_v_main_~z~0_38_31 (mod c_main_~n~0 4294967296)) (and (or (forall ((aux_mod_v_main_~y~0_36_31 Int)) (or (< 0 aux_mod_v_main_~y~0_36_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31) c_main_~y~0)))) (or (not .cse0) (forall ((aux_div_v_main_~y~0_36_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_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)))))))) (< aux_mod_v_main_~y~0_36_31 0))) (forall ((aux_div_v_main_~z~0_38_31 Int)) (not (= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~z~0)))) (forall ((aux_mod_v_main_~y~0_36_31 Int) (aux_div_v_main_~z~0_38_31 Int)) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_36_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_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31))))) (<= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~z~0) (<= 4294967296 aux_mod_v_main_~y~0_36_31) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_36_31 (* v_it_6 4294967295)) 4294967296))))) (<= aux_mod_v_main_~y~0_36_31 0)))) (>= aux_mod_v_main_~z~0_38_31 4294967296))) (< 0 (mod c_main_~y~0 4294967296))) is different from true [2022-03-17 15:27:03,312 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~z~0_38_31 Int)) (or (> 0 aux_mod_v_main_~z~0_38_31) (= aux_mod_v_main_~z~0_38_31 (mod c_main_~n~0 4294967296)) (and (or (forall ((aux_mod_v_main_~y~0_36_31 Int)) (or (< 0 aux_mod_v_main_~y~0_36_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31) c_main_~y~0)))) (or (not .cse0) (forall ((aux_div_v_main_~y~0_36_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_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)))))))) (< aux_mod_v_main_~y~0_36_31 0))) (forall ((aux_div_v_main_~z~0_38_31 Int)) (not (= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~z~0)))) (or (forall ((aux_mod_v_main_~y~0_36_31 Int) (aux_div_v_main_~y~0_36_31 Int) (aux_div_v_main_~z~0_38_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_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31))) (<= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~z~0) (<= 4294967296 aux_mod_v_main_~y~0_36_31) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_36_31 (* v_it_6 4294967295)) 4294967296))))) (<= aux_mod_v_main_~y~0_36_31 0))) (not (< 0 (mod c_main_~x~0 4294967296))))) (>= aux_mod_v_main_~z~0_38_31 4294967296))) (< 0 (mod c_main_~y~0 4294967296))) is different from true [2022-03-17 15:27:05,908 WARN L855 $PredicateComparison]: unable to prove that (or (< 0 (mod c_main_~y~0 4294967296)) (forall ((aux_mod_v_main_~z~0_38_31 Int)) (or (> 0 aux_mod_v_main_~z~0_38_31) (= aux_mod_v_main_~z~0_38_31 (mod c_main_~n~0 4294967296)) (and (or (forall ((aux_mod_v_main_~y~0_36_31 Int)) (or (< 0 aux_mod_v_main_~y~0_36_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31) c_main_~y~0)))) (or (not .cse0) (forall ((aux_div_v_main_~y~0_36_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_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)))))))) (< aux_mod_v_main_~y~0_36_31 0))) (forall ((aux_div_v_main_~z~0_38_31 Int)) (not (= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~y~0)))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_mod_v_main_~y~0_36_31 Int) (aux_div_v_main_~y~0_36_31 Int) (aux_div_v_main_~z~0_38_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_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_36_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 c_main_~y~0 1) (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31))))) (<= 4294967296 aux_mod_v_main_~y~0_36_31) (<= aux_mod_v_main_~y~0_36_31 0) (<= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~y~0))))) (>= aux_mod_v_main_~z~0_38_31 4294967296)))) is different from true [2022-03-17 15:27:07,996 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:07,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960220112] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:07,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:07,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 19 [2022-03-17 15:27:07,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106459274] [2022-03-17 15:27:07,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:07,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 15:27:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:07,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 15:27:07,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=180, Unknown=18, NotChecked=90, Total=342 [2022-03-17 15:27:07,998 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:26,546 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2022-03-17 15:27:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 15:27:26,546 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:27:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:26,547 INFO L225 Difference]: With dead ends: 50 [2022-03-17 15:27:26,548 INFO L226 Difference]: Without dead ends: 47 [2022-03-17 15:27:26,548 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 56.4s TimeCoverageRelationStatistics Valid=110, Invalid=383, Unknown=25, NotChecked=132, Total=650 [2022-03-17 15:27:26,548 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:26,549 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 58 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2022-03-17 15:27:26,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-17 15:27:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-03-17 15:27:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:26,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-03-17 15:27:26,556 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-03-17 15:27:26,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:26,556 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-03-17 15:27:26,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-03-17 15:27:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:26,557 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:26,557 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:27:26,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-17 15:27:26,759 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-17 15:27:26,759 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:26,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:26,760 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-03-17 15:27:26,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:26,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958999370] [2022-03-17 15:27:26,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:26,763 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:27:26,764 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:27:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:26,772 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:27:26,774 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:27:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:26,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958999370] [2022-03-17 15:27:26,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958999370] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72227767] [2022-03-17 15:27:26,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:26,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:26,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:26,886 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:27:26,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-17 15:27:26,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:26,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:27:26,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:27:27,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:27:27,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [72227767] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:27:27,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:27:27,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-03-17 15:27:27,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421186849] [2022-03-17 15:27:27,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:27:27,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:27:27,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:27,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:27:27,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-03-17 15:27:27,067 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:27,123 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-03-17 15:27:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:27:27,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:27:27,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:27,124 INFO L225 Difference]: With dead ends: 51 [2022-03-17 15:27:27,124 INFO L226 Difference]: Without dead ends: 48 [2022-03-17 15:27:27,124 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-17 15:27:27,125 INFO L912 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:27,125 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-03-17 15:27:27,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-17 15:27:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-03-17 15:27:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-03-17 15:27:27,128 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-03-17 15:27:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:27,128 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-03-17 15:27:27,128 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-03-17 15:27:27,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:27,129 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:27,129 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:27:27,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-17 15:27:27,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-17 15:27:27,339 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:27,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:27,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1138278570, now seen corresponding path program 1 times [2022-03-17 15:27:27,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:27,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780563327] [2022-03-17 15:27:27,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:27,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:27,343 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:27:27,343 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:27,353 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:27:27,355 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:27,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:27,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:27,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780563327] [2022-03-17 15:27:27,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780563327] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:27,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787889550] [2022-03-17 15:27:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:27,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:27,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:27,505 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:27:27,506 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:27:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:27,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:27:27,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:27,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:27:27,664 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:27:27,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787889550] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:27:27,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:27:27,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-03-17 15:27:27,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660199800] [2022-03-17 15:27:27,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:27:27,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:27:27,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:27,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:27:27,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-17 15:27:27,665 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:27,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:27,720 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-03-17 15:27:27,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:27:27,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:27:27,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:27,721 INFO L225 Difference]: With dead ends: 54 [2022-03-17 15:27:27,721 INFO L226 Difference]: Without dead ends: 51 [2022-03-17 15:27:27,722 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-17 15:27:27,722 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:27,722 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 80 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:27:27,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-17 15:27:27,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-03-17 15:27:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-03-17 15:27:27,725 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-03-17 15:27:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:27,725 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-03-17 15:27:27,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-03-17 15:27:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:27,725 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:27,728 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:27:27,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-17 15:27:27,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:27,928 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:27,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:27,929 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-03-17 15:27:27,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:27,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552003218] [2022-03-17 15:27:27,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:27,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:27,932 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:27:27,933 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:27,948 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:27:27,952 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:28,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552003218] [2022-03-17 15:27:28,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552003218] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104317804] [2022-03-17 15:27:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:28,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:28,079 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-17 15:27:28,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-17 15:27:28,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:28,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:27:28,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:28,267 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:28,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:30,936 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,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104317804] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:30,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:30,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-03-17 15:27:30,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196675174] [2022-03-17 15:27:30,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:30,937 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:27:30,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:30,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:27:30,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=303, Unknown=1, NotChecked=0, Total=380 [2022-03-17 15:27:30,938 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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:27:31,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:31,252 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-03-17 15:27:31,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-17 15:27:31,252 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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:27:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:31,253 INFO L225 Difference]: With dead ends: 62 [2022-03-17 15:27:31,253 INFO L226 Difference]: Without dead ends: 58 [2022-03-17 15:27:31,253 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=195, Invalid=734, Unknown=1, NotChecked=0, Total=930 [2022-03-17 15:27:31,253 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 46 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:31,253 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 60 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-03-17 15:27:31,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-17 15:27:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-03-17 15:27:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-17 15:27:31,256 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-03-17 15:27:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:31,256 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-17 15:27:31,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 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:27:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-17 15:27:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:31,257 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:31,257 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:27:31,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-17 15:27:31,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-17 15:27:31,471 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:31,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:31,472 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-03-17 15:27:31,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:31,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109601486] [2022-03-17 15:27:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:31,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:31,476 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:27:31,477 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:31,485 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:27:31,495 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:31,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:31,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:31,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:31,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109601486] [2022-03-17 15:27:31,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109601486] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:31,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792549502] [2022-03-17 15:27:31,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:31,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:31,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:31,613 INFO L229 MonitoredProcess]: Starting monitored process 17 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:31,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-17 15:27:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:31,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:27:31,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:27:31,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:27:31,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792549502] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:27:31,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:27:31,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-03-17 15:27:31,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149920257] [2022-03-17 15:27:31,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:27:31,832 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:27:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:31,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:27:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:27:31,833 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:31,889 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2022-03-17 15:27:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:27:31,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:27:31,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:31,890 INFO L225 Difference]: With dead ends: 51 [2022-03-17 15:27:31,890 INFO L226 Difference]: Without dead ends: 48 [2022-03-17 15:27:31,890 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:27:31,890 INFO L912 BasicCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:31,891 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 78 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-03-17 15:27:31,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-17 15:27:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-03-17 15:27:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-17 15:27:31,893 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-17 15:27:31,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:31,893 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-17 15:27:31,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:31,893 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-17 15:27:31,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:31,894 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:31,894 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:27:31,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-03-17 15:27:32,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-03-17 15:27:32,103 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:32,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:32,104 INFO L85 PathProgramCache]: Analyzing trace with hash -949517359, now seen corresponding path program 1 times [2022-03-17 15:27:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:32,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826724945] [2022-03-17 15:27:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:32,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:32,108 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:27:32,109 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:27:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:32,118 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:27:32,133 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:27:32,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:32,244 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:32,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826724945] [2022-03-17 15:27:32,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826724945] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044517685] [2022-03-17 15:27:32,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:32,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:32,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:32,245 INFO L229 MonitoredProcess]: Starting monitored process 18 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:32,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-03-17 15:27:32,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:32,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-17 15:27:32,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:32,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:27:32,401 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:27:32,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044517685] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:27:32,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:27:32,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-17 15:27:32,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556322704] [2022-03-17 15:27:32,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:27:32,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-17 15:27:32,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:32,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-17 15:27:32,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-17 15:27:32,403 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:32,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:32,462 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-03-17 15:27:32,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:27:32,462 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:27:32,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:32,462 INFO L225 Difference]: With dead ends: 54 [2022-03-17 15:27:32,462 INFO L226 Difference]: Without dead ends: 51 [2022-03-17 15:27:32,463 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:27:32,463 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:32,463 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 74 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:27:32,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-17 15:27:32,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-03-17 15:27:32,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:32,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-03-17 15:27:32,466 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-03-17 15:27:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:32,466 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-03-17 15:27:32,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-03-17 15:27:32,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:32,466 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:32,466 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:27:32,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-03-17 15:27:32,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:32,671 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:32,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:32,672 INFO L85 PathProgramCache]: Analyzing trace with hash -593960234, now seen corresponding path program 1 times [2022-03-17 15:27:32,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:32,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214939854] [2022-03-17 15:27:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:32,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:32,675 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:32,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:32,687 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:32,692 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:32,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:32,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:32,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:32,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214939854] [2022-03-17 15:27:32,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214939854] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:32,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523111795] [2022-03-17 15:27:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:32,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:32,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:32,844 INFO L229 MonitoredProcess]: Starting monitored process 19 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:32,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-03-17 15:27:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:32,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:27:32,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:33,314 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:33,314 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:33,700 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:33,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523111795] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:33,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:33,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2022-03-17 15:27:33,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051071666] [2022-03-17 15:27:33,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:33,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-17 15:27:33,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:33,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-17 15:27:33,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-03-17 15:27:33,702 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:36,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:27:36,111 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-03-17 15:27:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-17 15:27:36,111 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:27:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:27:36,112 INFO L225 Difference]: With dead ends: 63 [2022-03-17 15:27:36,112 INFO L226 Difference]: Without dead ends: 60 [2022-03-17 15:27:36,112 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=162, Invalid=593, Unknown=1, NotChecked=0, Total=756 [2022-03-17 15:27:36,113 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 54 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-17 15:27:36,113 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 95 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 118 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-03-17 15:27:36,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-17 15:27:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2022-03-17 15:27:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-03-17 15:27:36,115 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-03-17 15:27:36,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:27:36,115 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-03-17 15:27:36,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:27:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-03-17 15:27:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:27:36,116 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:27:36,116 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:27:36,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-03-17 15:27:36,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:36,323 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:27:36,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:27:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash 629018289, now seen corresponding path program 1 times [2022-03-17 15:27:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:27:36,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068292566] [2022-03-17 15:27:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:27:36,327 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:36,328 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:36,338 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:36,344 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-03-17 15:27:36,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:27:36,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:27:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068292566] [2022-03-17 15:27:36,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068292566] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:27:36,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276780379] [2022-03-17 15:27:36,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:27:36,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:27:36,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:27:36,504 INFO L229 MonitoredProcess]: Starting monitored process 20 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:36,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-03-17 15:27:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:27:36,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:27:36,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:27:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:37,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:27:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:27:59,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276780379] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:27:59,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:27:59,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2022-03-17 15:27:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760972869] [2022-03-17 15:27:59,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:27:59,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-17 15:27:59,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:27:59,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-17 15:27:59,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=323, Unknown=7, NotChecked=0, Total=420 [2022-03-17 15:27:59,955 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:00,397 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2022-03-17 15:28:00,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:28:00,398 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:28:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:00,398 INFO L225 Difference]: With dead ends: 55 [2022-03-17 15:28:00,398 INFO L226 Difference]: Without dead ends: 52 [2022-03-17 15:28:00,398 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 22.4s TimeCoverageRelationStatistics Valid=167, Invalid=582, Unknown=7, NotChecked=0, Total=756 [2022-03-17 15:28:00,399 INFO L912 BasicCegarLoop]: 13 mSDtfsCounter, 59 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 60 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:00,399 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 77 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 115 Invalid, 0 Unknown, 60 Unchecked, 0.2s Time] [2022-03-17 15:28:00,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-17 15:28:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-03-17 15:28:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-17 15:28:00,401 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-03-17 15:28:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:00,401 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-17 15:28:00,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-17 15:28:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:28:00,402 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:00,402 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:28:00,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-03-17 15:28:00,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:00,615 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:00,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005366, now seen corresponding path program 1 times [2022-03-17 15:28:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:00,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122728083] [2022-03-17 15:28:00,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:00,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:00,619 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:00,620 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:00,628 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:00,632 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:00,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:00,884 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:00,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:00,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122728083] [2022-03-17 15:28:00,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122728083] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:28:00,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875664097] [2022-03-17 15:28:00,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:00,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:00,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:28:00,886 INFO L229 MonitoredProcess]: Starting monitored process 21 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:00,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-03-17 15:28:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:00,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-17 15:28:00,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:28:01,782 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:01,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:28:18,527 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:18,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875664097] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:28:18,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:28:18,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-03-17 15:28:18,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444229942] [2022-03-17 15:28:18,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:28:18,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:28:18,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:18,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:28:18,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=298, Unknown=7, NotChecked=0, Total=380 [2022-03-17 15:28:18,529 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:28:21,410 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2022-03-17 15:28:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-17 15:28:21,412 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:28:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:28:21,413 INFO L225 Difference]: With dead ends: 69 [2022-03-17 15:28:21,413 INFO L226 Difference]: Without dead ends: 65 [2022-03-17 15:28:21,413 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=170, Invalid=634, Unknown=8, NotChecked=0, Total=812 [2022-03-17 15:28:21,414 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 64 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:28:21,414 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 65 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 118 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2022-03-17 15:28:21,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-17 15:28:21,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-03-17 15:28:21,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2022-03-17 15:28:21,416 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 19 [2022-03-17 15:28:21,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:28:21,416 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2022-03-17 15:28:21,416 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:28:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2022-03-17 15:28:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:28:21,417 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:28:21,417 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:28:21,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-03-17 15:28:21,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-03-17 15:28:21,623 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:28:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:28:21,624 INFO L85 PathProgramCache]: Analyzing trace with hash -405199023, now seen corresponding path program 1 times [2022-03-17 15:28:21,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:28:21,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235449881] [2022-03-17 15:28:21,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:21,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:28:21,627 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:21,628 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-03-17 15:28:21,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:21,635 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:28:21,653 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-03-17 15:28:21,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:28:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:21,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:21,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:28:21,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235449881] [2022-03-17 15:28:21,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235449881] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:28:21,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294617610] [2022-03-17 15:28:21,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:28:21,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:28:21,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:28:21,995 INFO L229 MonitoredProcess]: Starting monitored process 22 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:21,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-03-17 15:28:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:28:22,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-17 15:28:22,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:28:28,689 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:28,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:28:46,498 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:46,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294617610] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:28:46,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:28:46,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-03-17 15:28:46,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288746942] [2022-03-17 15:28:46,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:28:46,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-17 15:28:46,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:28:46,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-17 15:28:46,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=329, Unknown=6, NotChecked=0, Total=420 [2022-03-17 15:28:46,499 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:01,615 WARN L232 SmtUtils]: Spent 11.47s 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:29:02,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:29:02,378 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2022-03-17 15:29:02,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-17 15:29:02,378 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:29:02,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:29:02,379 INFO L225 Difference]: With dead ends: 72 [2022-03-17 15:29:02,379 INFO L226 Difference]: Without dead ends: 68 [2022-03-17 15:29:02,379 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 37.8s TimeCoverageRelationStatistics Valid=247, Invalid=868, Unknown=7, NotChecked=0, Total=1122 [2022-03-17 15:29:02,380 INFO L912 BasicCegarLoop]: 11 mSDtfsCounter, 65 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:29:02,380 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 71 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 107 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2022-03-17 15:29:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-17 15:29:02,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2022-03-17 15:29:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2022-03-17 15:29:02,382 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 19 [2022-03-17 15:29:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:29:02,382 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2022-03-17 15:29:02,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2022-03-17 15:29:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-17 15:29:02,383 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:29:02,383 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:29:02,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-03-17 15:29:02,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-03-17 15:29:02,587 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:29:02,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:29:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2144376817, now seen corresponding path program 1 times [2022-03-17 15:29:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:29:02,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092646630] [2022-03-17 15:29:02,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:29:02,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:29:02,591 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:02,591 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:02,602 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:02,606 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.5))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:29:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:03,006 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:29:03,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:29:03,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092646630] [2022-03-17 15:29:03,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092646630] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:29:03,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667386917] [2022-03-17 15:29:03,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:29:03,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:29:03,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:29:03,008 INFO L229 MonitoredProcess]: Starting monitored process 23 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:03,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-03-17 15:29:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:03,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 15:29:03,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:29:05,831 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse3 (< 0 c_main_~y~0)) (.cse4 (< 0 .cse6)) (.cse5 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1))))) (.cse2 (mod c_main_~y~0 4294967296))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 .cse2) .cse3 .cse4 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse5 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse6 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse3 .cse4 .cse5)) (<= .cse2 0) (= c_main_~y~0 c_main_~z~0))))) is different from false [2022-03-17 15:29:08,003 WARN L833 $PredicateComparison]: unable to prove that (and (not (< 0 (mod c_main_~z~0 4294967296))) (let ((.cse5 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse2 (< 0 c_main_~y~0)) (.cse3 (< 0 .cse5)) (.cse4 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1)))))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 (mod c_main_~y~0 4294967296)) .cse2 .cse3 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse4 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse5 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse2 .cse3 .cse4)) (= c_main_~y~0 c_main_~z~0)))))) is different from false [2022-03-17 15:29:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-17 15:29:08,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:29:40,643 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:29:40,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667386917] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:29:40,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:29:40,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-03-17 15:29:40,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86906462] [2022-03-17 15:29:40,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:29:40,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-17 15:29:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:29:40,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-17 15:29:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=421, Unknown=14, NotChecked=90, Total=650 [2022-03-17 15:29:40,645 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:43,012 WARN L833 $PredicateComparison]: unable to prove that (and (let ((.cse6 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse3 (< 0 c_main_~y~0)) (.cse4 (< 0 .cse6)) (.cse5 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1))))) (.cse2 (mod c_main_~y~0 4294967296))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 .cse2) .cse3 .cse4 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse5 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse6 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse3 .cse4 .cse5)) (<= .cse2 0) (= c_main_~y~0 c_main_~z~0))))) (or (< (+ (* (div c_main_~z~0 4294967296) 4294967296) c_main_~n~0) (+ (* (div c_main_~n~0 4294967296) 4294967296) c_main_~z~0 1)) (<= (+ (* 4294967296 (div c_main_~y~0 4294967296)) 1) c_main_~y~0))) is different from false [2022-03-17 15:29:45,128 WARN L833 $PredicateComparison]: unable to prove that (and (not (< 0 (mod c_main_~z~0 4294967296))) (let ((.cse5 (mod c_main_~n~0 4294967296)) (.cse0 (* (- 1) c_main_~y~0))) (let ((.cse1 (+ .cse0 c_main_~n~0)) (.cse2 (< 0 c_main_~y~0)) (.cse3 (< 0 .cse5)) (.cse4 (forall ((v_it_1 Int)) (or (< 0 (mod (+ c_main_~n~0 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_it_1 1) c_main_~y~0)) (not (<= 1 v_it_1)))))) (or (and (= (+ .cse0 c_main_~x~0 c_main_~z~0) .cse1) (< 0 (mod c_main_~y~0 4294967296)) .cse2 .cse3 (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_it_2 c_main_~z~0 1) c_main_~y~0)) (< 0 (mod (+ (* v_it_2 4294967295) c_main_~y~0) 4294967296)))) .cse4 (< c_main_~z~0 c_main_~y~0)) (and (or (and (<= .cse5 0) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0)) (and (= .cse1 c_main_~x~0) .cse2 .cse3 .cse4)) (= c_main_~y~0 c_main_~z~0))))) (or (let ((.cse7 (* (div c_main_~n~0 4294967296) 4294967296)) (.cse6 (+ (* (div c_main_~z~0 4294967296) 4294967296) c_main_~n~0))) (and (< .cse6 (+ .cse7 c_main_~z~0 1)) (<= (+ .cse7 c_main_~z~0) .cse6))) (<= (+ (* 4294967296 (div c_main_~y~0 4294967296)) 1) c_main_~y~0))) is different from false [2022-03-17 15:29:48,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:29:48,840 INFO L93 Difference]: Finished difference Result 79 states and 131 transitions. [2022-03-17 15:29:48,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-17 15:29:48,840 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-03-17 15:29:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:29:48,841 INFO L225 Difference]: With dead ends: 79 [2022-03-17 15:29:48,841 INFO L226 Difference]: Without dead ends: 75 [2022-03-17 15:29:48,842 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=321, Invalid=1010, Unknown=17, NotChecked=292, Total=1640 [2022-03-17 15:29:48,842 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 105 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 15:29:48,842 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 65 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 112 Invalid, 0 Unknown, 149 Unchecked, 0.3s Time] [2022-03-17 15:29:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-17 15:29:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 53. [2022-03-17 15:29:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.7291666666666667) internal successors, (83), 48 states have internal predecessors, (83), 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:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 87 transitions. [2022-03-17 15:29:48,844 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 87 transitions. Word has length 19 [2022-03-17 15:29:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:29:48,845 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 87 transitions. [2022-03-17 15:29:48,845 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:29:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 87 transitions. [2022-03-17 15:29:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:29:48,845 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:29:48,845 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:29:48,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-03-17 15:29:49,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:29:49,053 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:29:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:29:49,054 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 2 times [2022-03-17 15:29:49,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:29:49,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538231176] [2022-03-17 15:29:49,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:29:49,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:29:49,057 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:29:49,057 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:49,058 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:49,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:49,072 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:49,075 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:49,076 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:29:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:29:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:29:49,555 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:29:49,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:29:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538231176] [2022-03-17 15:29:49,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538231176] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:29:49,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145020586] [2022-03-17 15:29:49,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:29:49,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:29:49,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:29:49,556 INFO L229 MonitoredProcess]: Starting monitored process 24 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:49,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-03-17 15:29:49,584 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:29:49,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:29:49,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 15:29:49,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:29:50,031 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:29:50,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:30:37,841 WARN L855 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_65_31 Int) (aux_mod_main_~z~0_26 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_65_31) (= aux_mod_v_main_~z~0_65_31 (mod c_main_~n~0 4294967296)) (< aux_mod_v_main_~z~0_65_31 0) (< 0 aux_mod_main_~z~0_26) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_65_31 Int) (aux_div_main_~z~0_26 Int)) (not (= (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)) (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26)))))) (or (not .cse0) (and (or (< 0 (mod (+ aux_mod_main_~z~0_26 (* aux_mod_v_main_~z~0_65_31 4294967295) c_main_~y~0) 4294967296)) (forall ((aux_div_v_main_~z~0_65_31 Int) (aux_div_main_~z~0_26 Int)) (or (not (< (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26)) (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)))) (exists ((v_it_6 Int)) (and (<= (+ aux_mod_main_~z~0_26 v_it_6 (* 4294967296 aux_div_main_~z~0_26) 1) (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31))) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~z~0_65_31 Int) (aux_div_main_~z~0_26 Int) (aux_div_v_main_~y~0_65_31 Int) (aux_mod_v_main_~y~0_65_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_65_31 4294967296))) (or (<= aux_mod_v_main_~y~0_65_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 (* aux_div_v_main_~y~0_65_31 4294967296) aux_mod_v_main_~y~0_65_31 1) c_main_~y~0) (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ aux_mod_v_main_~z~0_65_31 .cse1 (* 4294967296 aux_div_v_main_~z~0_65_31) aux_mod_v_main_~y~0_65_31) (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26) c_main_~y~0)) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_65_31)) (<= 4294967296 aux_mod_v_main_~y~0_65_31) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_65_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ aux_mod_main_~z~0_26 v_it_6 (* 4294967296 aux_div_main_~z~0_26) c_main_~y~0 1) (+ aux_mod_v_main_~z~0_65_31 (* aux_div_v_main_~y~0_65_31 4294967296) (* 4294967296 aux_div_v_main_~z~0_65_31) aux_mod_v_main_~y~0_65_31))))))))))) (< aux_mod_main_~z~0_26 0))) is different from true [2022-03-17 15:30:50,306 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:30:50,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145020586] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:30:50,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:30:50,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2022-03-17 15:30:50,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434178552] [2022-03-17 15:30:50,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:30:50,307 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-17 15:30:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:30:50,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-17 15:30:50,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=323, Unknown=11, NotChecked=38, Total=462 [2022-03-17 15:30:50,307 INFO L87 Difference]: Start difference. First operand 53 states and 87 transitions. Second operand has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 19 states have internal predecessors, (38), 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:30:50,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:30:50,854 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2022-03-17 15:30:50,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-17 15:30:50,854 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 19 states have internal predecessors, (38), 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 20 [2022-03-17 15:30:50,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:30:50,855 INFO L225 Difference]: With dead ends: 70 [2022-03-17 15:30:50,855 INFO L226 Difference]: Without dead ends: 64 [2022-03-17 15:30:50,855 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=152, Invalid=543, Unknown=11, NotChecked=50, Total=756 [2022-03-17 15:30:50,856 INFO L912 BasicCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 15:30:50,856 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 108 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 59 Unchecked, 0.3s Time] [2022-03-17 15:30:50,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-03-17 15:30:50,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 55. [2022-03-17 15:30:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.72) internal successors, (86), 50 states have internal predecessors, (86), 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:30:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2022-03-17 15:30:50,858 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 20 [2022-03-17 15:30:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:30:50,858 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 90 transitions. [2022-03-17 15:30:50,859 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 19 states have internal predecessors, (38), 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:30:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 90 transitions. [2022-03-17 15:30:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:30:50,859 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:30:50,859 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:30:50,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-03-17 15:30:51,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:30:51,067 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:30:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:30:51,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-03-17 15:30:51,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:30:51,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893280410] [2022-03-17 15:30:51,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:30:51,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:30:51,072 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:30:51,073 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:30:51,073 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:30:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:30:51,099 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:30:51,101 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:30:51,103 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:30:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:30:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:30:51,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:30:51,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:30:51,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893280410] [2022-03-17 15:30:51,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893280410] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:30:51,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79051508] [2022-03-17 15:30:51,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:30:51,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:30:51,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:30:51,530 INFO L229 MonitoredProcess]: Starting monitored process 25 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:30:51,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-03-17 15:30:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:30:51,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:30:51,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:30:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:30:51,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:31:04,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-17 15:31:04,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79051508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:31:04,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:31:04,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-03-17 15:31:04,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451492280] [2022-03-17 15:31:04,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:31:04,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-17 15:31:04,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:31:04,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-17 15:31:04,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=391, Unknown=4, NotChecked=0, Total=506 [2022-03-17 15:31:04,890 INFO L87 Difference]: Start difference. First operand 55 states and 90 transitions. Second operand has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 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:31:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:31:05,653 INFO L93 Difference]: Finished difference Result 82 states and 131 transitions. [2022-03-17 15:31:05,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-17 15:31:05,653 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 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 20 [2022-03-17 15:31:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:31:05,653 INFO L225 Difference]: With dead ends: 82 [2022-03-17 15:31:05,653 INFO L226 Difference]: Without dead ends: 78 [2022-03-17 15:31:05,654 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=252, Invalid=866, Unknown=4, NotChecked=0, Total=1122 [2022-03-17 15:31:05,654 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:31:05,654 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 75 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 98 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2022-03-17 15:31:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-03-17 15:31:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 54. [2022-03-17 15:31:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.7346938775510203) internal successors, (85), 49 states have internal predecessors, (85), 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:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 89 transitions. [2022-03-17 15:31:05,657 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 89 transitions. Word has length 20 [2022-03-17 15:31:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:31:05,657 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 89 transitions. [2022-03-17 15:31:05,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.6521739130434783) internal successors, (38), 20 states have internal predecessors, (38), 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:31:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 89 transitions. [2022-03-17 15:31:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:31:05,657 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:31:05,657 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:31:05,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-03-17 15:31:05,859 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-03-17 15:31:05,859 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:31:05,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:31:05,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-03-17 15:31:05,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:31:05,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063642277] [2022-03-17 15:31:05,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:31:05,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:31:05,864 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:31:05,865 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:31:05,865 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-17 15:31:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:31:05,876 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:31:05,879 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:31:05,881 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-17 15:31:06,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:31:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:31:06,188 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:31:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:31:06,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063642277] [2022-03-17 15:31:06,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063642277] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:31:06,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [156140274] [2022-03-17 15:31:06,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:31:06,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:31:06,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:31:06,190 INFO L229 MonitoredProcess]: Starting monitored process 26 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:06,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-03-17 15:31:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:31:06,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-17 15:31:06,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:31:06,699 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:31:06,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:32:36,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_main_~y~0_26 Int) (aux_mod_v_main_~z~0_77_31 Int) (aux_mod_main_~z~0_26 Int)) (or (< aux_mod_main_~y~0_26 0) (< 0 aux_mod_main_~y~0_26) (and (or (forall ((aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (not (= (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26)) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))))) (forall ((aux_mod_v_main_~y~0_75_31 Int)) (or (< aux_mod_v_main_~y~0_75_31 0) (< 0 aux_mod_v_main_~y~0_75_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int)) (not (= (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31) (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)))))) (or (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (<= 1 v_it_4))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))))) (not .cse0))))))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_div_v_main_~y~0_75_31 Int) (aux_mod_v_main_~y~0_75_31 Int) (aux_div_main_~y~0_26 Int) (aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (or (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_75_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ aux_mod_main_~z~0_26 v_it_6 (* 4294967296 aux_div_main_~z~0_26) 1) (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_75_31 0) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ aux_mod_main_~y~0_26 v_it_4 (* 4294967296 aux_div_main_~y~0_26) 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (<= 1 v_it_4))) (<= 4294967296 aux_mod_v_main_~y~0_75_31) (<= (+ aux_mod_v_main_~z~0_77_31 (* 4294967296 aux_div_v_main_~z~0_77_31)) (+ aux_mod_main_~z~0_26 (* 4294967296 aux_div_main_~z~0_26))) (not (< (+ aux_mod_main_~y~0_26 (* 4294967296 aux_div_main_~y~0_26)) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))))))) (< aux_mod_v_main_~z~0_77_31 0) (< 0 aux_mod_main_~z~0_26) (= aux_mod_v_main_~z~0_77_31 (mod c_main_~n~0 4294967296)) (<= 4294967296 aux_mod_v_main_~z~0_77_31) (< aux_mod_main_~z~0_26 0))) is different from false [2022-03-17 15:33:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-17 15:33:00,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [156140274] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:33:00,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:33:00,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-17 15:33:00,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250761635] [2022-03-17 15:33:00,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:33:00,833 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-17 15:33:00,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:33:00,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-17 15:33:00,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=389, Unknown=19, NotChecked=42, Total=552 [2022-03-17 15:33:00,834 INFO L87 Difference]: Start difference. First operand 54 states and 89 transitions. Second operand has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 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:33:16,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:33:16,022 INFO L93 Difference]: Finished difference Result 71 states and 116 transitions. [2022-03-17 15:33:16,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-17 15:33:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 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 20 [2022-03-17 15:33:16,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:33:16,023 INFO L225 Difference]: With dead ends: 71 [2022-03-17 15:33:16,023 INFO L226 Difference]: Without dead ends: 68 [2022-03-17 15:33:16,024 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 69.9s TimeCoverageRelationStatistics Valid=191, Invalid=720, Unknown=23, NotChecked=58, Total=992 [2022-03-17 15:33:16,024 INFO L912 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-17 15:33:16,024 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 110 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 151 Invalid, 0 Unknown, 74 Unchecked, 0.3s Time] [2022-03-17 15:33:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-17 15:33:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2022-03-17 15:33:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.7450980392156863) internal successors, (89), 51 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 93 transitions. [2022-03-17 15:33:16,026 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 93 transitions. Word has length 20 [2022-03-17 15:33:16,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:33:16,027 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 93 transitions. [2022-03-17 15:33:16,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 21 states have internal predecessors, (41), 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:33:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 93 transitions. [2022-03-17 15:33:16,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:33:16,027 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:33:16,027 INFO L500 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:33:16,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-03-17 15:33:16,231 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-03-17 15:33:16,231 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:33:16,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:33:16,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-03-17 15:33:16,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:33:16,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858159641] [2022-03-17 15:33:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:33:16,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:33:16,235 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:16,236 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:33:16,237 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:33:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:16,246 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:16,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-17 15:33:16,249 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.6))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:16,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:33:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:16,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-17 15:33:16,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:33:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858159641] [2022-03-17 15:33:16,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858159641] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:33:16,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959997404] [2022-03-17 15:33:16,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:33:16,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:33:16,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:33:16,650 INFO L229 MonitoredProcess]: Starting monitored process 27 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:16,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-03-17 15:33:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:16,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-17 15:33:16,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:33:17,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-17 15:33:17,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-17 15:33:17,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959997404] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-17 15:33:17,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-17 15:33:17,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-03-17 15:33:17,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148459589] [2022-03-17 15:33:17,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-17 15:33:17,067 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-17 15:33:17,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:33:17,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-17 15:33:17,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-17 15:33:17,067 INFO L87 Difference]: Start difference. First operand 56 states and 93 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:33:17,175 INFO L93 Difference]: Finished difference Result 71 states and 114 transitions. [2022-03-17 15:33:17,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-17 15:33:17,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-03-17 15:33:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:33:17,175 INFO L225 Difference]: With dead ends: 71 [2022-03-17 15:33:17,176 INFO L226 Difference]: Without dead ends: 68 [2022-03-17 15:33:17,176 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-03-17 15:33:17,176 INFO L912 BasicCegarLoop]: 15 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-17 15:33:17,176 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 72 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-17 15:33:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-03-17 15:33:17,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 52. [2022-03-17 15:33:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.7234042553191489) internal successors, (81), 47 states have internal predecessors, (81), 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:17,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2022-03-17 15:33:17,178 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 20 [2022-03-17 15:33:17,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:33:17,178 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2022-03-17 15:33:17,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-17 15:33:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2022-03-17 15:33:17,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:33:17,179 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:33:17,179 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:33:17,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-03-17 15:33:17,387 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-03-17 15:33:17,387 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:33:17,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:33:17,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-03-17 15:33:17,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:33:17,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472856171] [2022-03-17 15:33:17,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:33:17,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:33:17,391 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:33:17,392 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:17,392 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:17,402 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:33:17,403 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:17,405 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:33:17,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:33:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:33:17,834 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:33:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:33:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472856171] [2022-03-17 15:33:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472856171] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:33:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649873296] [2022-03-17 15:33:17,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:33:17,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:33:17,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:33:17,836 INFO L229 MonitoredProcess]: Starting monitored process 28 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:17,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-03-17 15:33:17,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:33:17,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:33:17,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-17 15:33:17,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:33:18,344 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:33:18,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:33:32,600 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (div c_main_~n~0 4294967296)) (.cse1 (* (- 1) c_main_~z~0))) (and (< (div (+ (- 1) .cse1) (- 4294967296)) (+ (div (+ (* (- 1) c_main_~n~0) c_main_~z~0) 4294967296) .cse2 2)) (<= (+ .cse2 (div (+ .cse1 c_main_~n~0) (- 4294967296))) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1))))) (or (not .cse0) (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (and (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ c_main_~y~0 c_main_~z~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_82_31 0) (<= 4294967296 aux_mod_v_main_~y~0_82_31)))) (or (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))))) (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)))) (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (< aux_mod_v_main_~z~0_84_31 0))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ c_main_~y~0 c_main_~z~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6))) (<= aux_mod_v_main_~y~0_82_31 0) (<= 4294967296 aux_mod_v_main_~y~0_82_31)))) (or (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))))) (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))))))) is different from false [2022-03-17 15:34:18,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~z~0_86 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (* (- 1) v_main_~z~0_86)) (.cse1 (div c_main_~n~0 4294967296))) (and (<= (+ .cse1 (div (+ c_main_~n~0 .cse2) (- 4294967296))) (+ (div (+ v_main_~z~0_86 (- 4294967296)) 4294967296) 1)) (< (div (+ (- 1) .cse2) (- 4294967296)) (+ .cse1 2 (div (+ v_main_~z~0_86 (* (- 1) c_main_~n~0)) 4294967296)))))) (or (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (< aux_mod_v_main_~z~0_84_31 0)))) (not .cse0)))) (let ((.cse5 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse5) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~z~0_86 v_it_5 1) c_main_~z~0))) (not (< v_main_~z~0_86 c_main_~z~0))) (or .cse5 (not (= v_main_~z~0_86 c_main_~z~0))))))) is different from false [2022-03-17 15:35:13,549 WARN L232 SmtUtils]: Spent 12.02s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:35:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-17 15:35:21,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649873296] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-17 15:35:21,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-17 15:35:21,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 20 [2022-03-17 15:35:21,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146659287] [2022-03-17 15:35:21,926 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-17 15:35:21,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-17 15:35:21,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-17 15:35:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-17 15:35:21,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=236, Unknown=7, NotChecked=66, Total=380 [2022-03-17 15:35:21,927 INFO L87 Difference]: Start difference. First operand 52 states and 85 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, (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:35:24,314 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_#NULL.base| |c_old(#NULL.base)|) (<= c_main_~x~0 (* (div c_main_~x~0 4294967296) 4294967296)) (= c_main_~y~0 0) (= c_main_~n~0 c_main_~x~0) (= c_main_~z~0 0) (forall ((v_main_~z~0_86 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (let ((.cse2 (* (- 1) v_main_~z~0_86)) (.cse1 (div c_main_~n~0 4294967296))) (and (<= (+ .cse1 (div (+ c_main_~n~0 .cse2) (- 4294967296))) (+ (div (+ v_main_~z~0_86 (- 4294967296)) 4294967296) 1)) (< (div (+ (- 1) .cse2) (- 4294967296)) (+ .cse1 2 (div (+ v_main_~z~0_86 (* (- 1) c_main_~n~0)) 4294967296)))))) (or (and (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31) c_main_~n~0) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse3 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse3 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (<= 4294967296 aux_mod_v_main_~z~0_84_31))) (forall ((aux_mod_v_main_~z~0_84_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_84_31 1)) (and (or (< 0 (mod (+ v_main_~z~0_86 c_main_~y~0 (* aux_mod_v_main_~z~0_84_31 4294967295)) 4294967296)) (forall ((aux_div_v_main_~z~0_84_31 Int)) (or (not (< v_main_~z~0_86 (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 1) (+ aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296)))))))) (forall ((aux_div_v_main_~y~0_82_31 Int) (aux_mod_v_main_~y~0_82_31 Int) (aux_div_v_main_~z~0_84_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_82_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ (* aux_div_v_main_~y~0_82_31 4294967296) v_it_6 aux_mod_v_main_~y~0_82_31 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= (+ .cse4 aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31) (+ v_main_~z~0_86 c_main_~y~0)) (<= c_main_~y~0 (+ .cse4 aux_mod_v_main_~y~0_82_31)) (<= aux_mod_v_main_~y~0_82_31 0) (exists ((v_it_6 Int)) (and (not (< 0 (mod (+ aux_mod_v_main_~y~0_82_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6) (<= (+ v_main_~z~0_86 v_it_6 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_82_31 4294967296) aux_mod_v_main_~z~0_84_31 (* 4294967296 aux_div_v_main_~z~0_84_31) aux_mod_v_main_~y~0_82_31)))) (<= 4294967296 aux_mod_v_main_~y~0_82_31))))) (< aux_mod_v_main_~z~0_84_31 0)))) (not .cse0)))) (let ((.cse5 (< 0 (mod c_main_~z~0 4294967296)))) (and (or (not .cse5) (exists ((v_it_5 Int)) (and (not (< 0 (mod (+ (* v_it_5 4294967295) c_main_~z~0) 4294967296))) (<= 1 v_it_5) (<= (+ v_main_~z~0_86 v_it_5 1) c_main_~z~0))) (not (< v_main_~z~0_86 c_main_~z~0))) (or .cse5 (not (= v_main_~z~0_86 c_main_~z~0))))))) (= |c_#NULL.offset| |c_old(#NULL.offset)|)) is different from false [2022-03-17 15:35:24,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-17 15:35:24,731 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2022-03-17 15:35:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-17 15:35:24,732 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, (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 20 [2022-03-17 15:35:24,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-17 15:35:24,732 INFO L225 Difference]: With dead ends: 69 [2022-03-17 15:35:24,732 INFO L226 Difference]: Without dead ends: 63 [2022-03-17 15:35:24,732 INFO L911 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 30.5s TimeCoverageRelationStatistics Valid=128, Invalid=428, Unknown=8, NotChecked=138, Total=702 [2022-03-17 15:35:24,733 INFO L912 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-17 15:35:24,733 INFO L913 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 80 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2022-03-17 15:35:24,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-03-17 15:35:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-03-17 15:35:24,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.72) internal successors, (86), 50 states have internal predecessors, (86), 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:35:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 90 transitions. [2022-03-17 15:35:24,735 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 90 transitions. Word has length 20 [2022-03-17 15:35:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-17 15:35:24,735 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 90 transitions. [2022-03-17 15:35:24,735 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, (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:35:24,736 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 90 transitions. [2022-03-17 15:35:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-17 15:35:24,736 INFO L492 BasicCegarLoop]: Found error trace [2022-03-17 15:35:24,736 INFO L500 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-17 15:35:24,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-03-17 15:35:24,939 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-03-17 15:35:24,939 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-17 15:35:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-17 15:35:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash 641395694, now seen corresponding path program 2 times [2022-03-17 15:35:24,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-17 15:35:24,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382368136] [2022-03-17 15:35:24,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-17 15:35:24,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-17 15:35:24,944 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:35:24,945 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:35:24,945 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:35:24,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:35:24,955 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:35:24,957 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-17 15:35:24,958 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-17 15:35:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-17 15:35:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-17 15:35:25,278 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:35:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-17 15:35:25,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382368136] [2022-03-17 15:35:25,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382368136] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-17 15:35:25,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467404148] [2022-03-17 15:35:25,278 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-17 15:35:25,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-17 15:35:25,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-17 15:35:25,280 INFO L229 MonitoredProcess]: Starting monitored process 29 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:35:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-03-17 15:35:25,308 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-17 15:35:25,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-17 15:35:25,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-17 15:35:25,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-17 15:35:25,725 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:35:25,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-17 15:36:03,205 WARN L232 SmtUtils]: Spent 16.31s on a formula simplification that was a NOOP. DAG size: 94 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-17 15:38:48,557 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (let ((.cse10 (div c_main_~n~0 4294967296)) (.cse9 (* (- 1) c_main_~z~0))) (and (< (div (+ (- 1) .cse9) (- 4294967296)) (+ (div (+ (* (- 1) c_main_~n~0) c_main_~z~0) 4294967296) .cse10 2)) (<= (+ .cse10 (div (+ .cse9 c_main_~n~0) (- 4294967296))) (+ (div (+ (- 4294967296) c_main_~z~0) 4294967296) 1))))) (.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (let ((.cse1 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse1 .cse2) (or (and (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31 1)) (< aux_mod_v_main_~z~0_91_31 0) (and (or (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse3 (* aux_div_v_main_~y~0_88_31 4294967296))) (or (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse3) (+ c_main_~y~0 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= c_main_~y~0 (+ aux_mod_v_main_~y~0_88_31 .cse3)) (<= aux_mod_v_main_~y~0_88_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296))))))))))) (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31) c_main_~n~0) (<= 4294967296 aux_mod_v_main_~z~0_91_31) (and (or (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31)))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse4 (* aux_div_v_main_~y~0_88_31 4294967296))) (or (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse4) (+ c_main_~y~0 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) c_main_~y~0) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= c_main_~y~0 (+ aux_mod_v_main_~y~0_88_31 .cse4)) (<= aux_mod_v_main_~y~0_88_31 0) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296)))))))))))) (not .cse1))))) (or (and (forall ((aux_div_v_main_~y~0_89_31 Int) (aux_mod_v_main_~y~0_89_31 Int)) (or (<= aux_mod_v_main_~y~0_89_31 0) (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_89_31 4294967296) aux_mod_v_main_~y~0_89_31)) (<= 1 v_it_4))) (<= (+ (* aux_div_v_main_~y~0_89_31 4294967296) aux_mod_v_main_~y~0_89_31) c_main_~y~0) (<= 4294967296 aux_mod_v_main_~y~0_89_31) (and (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31) c_main_~n~0) (<= 4294967296 aux_mod_v_main_~z~0_91_31) (and (or (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) aux_mod_v_main_~y~0_89_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_89_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))))))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse6 (* aux_div_v_main_~y~0_88_31 4294967296)) (.cse5 (* aux_div_v_main_~y~0_89_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ (* aux_div_v_main_~y~0_89_31 4294967296) v_it_6 aux_mod_v_main_~y~0_89_31 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= (+ .cse5 aux_mod_v_main_~y~0_89_31) (+ aux_mod_v_main_~y~0_88_31 .cse6)) (<= aux_mod_v_main_~y~0_88_31 0) (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse6) (+ .cse5 aux_mod_v_main_~y~0_89_31 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_89_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_89_31 4294967296) aux_mod_v_main_~y~0_89_31)))))))))) (forall ((aux_mod_v_main_~z~0_91_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~z~0_91_31 1)) (< aux_mod_v_main_~z~0_91_31 0) (and (or (< 0 (mod (+ (* aux_mod_v_main_~z~0_91_31 4294967295) aux_mod_v_main_~y~0_89_31 c_main_~z~0) 4294967296)) (forall ((aux_div_v_main_~z~0_91_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_89_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31))))))) (forall ((aux_mod_v_main_~y~0_88_31 Int) (aux_div_v_main_~z~0_91_31 Int) (aux_div_v_main_~y~0_88_31 Int)) (let ((.cse8 (* aux_div_v_main_~y~0_88_31 4294967296)) (.cse7 (* aux_div_v_main_~y~0_89_31 4294967296))) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_88_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ (* aux_div_v_main_~y~0_89_31 4294967296) v_it_6 aux_mod_v_main_~y~0_89_31 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296))))) (<= 4294967296 aux_mod_v_main_~y~0_88_31) (<= (+ .cse7 aux_mod_v_main_~y~0_89_31) (+ aux_mod_v_main_~y~0_88_31 .cse8)) (<= aux_mod_v_main_~y~0_88_31 0) (<= (+ aux_mod_v_main_~z~0_91_31 (* 4294967296 aux_div_v_main_~z~0_91_31) aux_mod_v_main_~y~0_88_31 .cse8) (+ .cse7 aux_mod_v_main_~y~0_89_31 c_main_~z~0)) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_89_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 aux_mod_v_main_~y~0_88_31 (* aux_div_v_main_~y~0_88_31 4294967296) 1) (+ (* aux_div_v_main_~y~0_89_31 4294967296) aux_mod_v_main_~y~0_89_31))))))))))))) (or (forall ((aux_div_v_main_~y~0_89_31 Int) (aux_mod_v_main_~y~0_89_31 Int)) (or (< aux_mod_v_main_~y~0_89_31 0) (< 0 aux_mod_v_main_~y~0_89_31) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_89_31 4294967296) aux_mod_v_main_~y~0_89_31)) (<= 1 v_it_4))) (<= (+ (* aux_div_v_main_~y~0_89_31 4294967296) aux_mod_v_main_~y~0_89_31) c_main_~y~0))) .cse2)) (not .cse0)))) is different from false