/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-b030c9e [2022-03-20 04:05:37,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:05:37,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:05:37,300 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:05:37,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:05:37,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:05:37,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:05:37,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:05:37,306 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:05:37,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:05:37,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:05:37,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:05:37,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:05:37,313 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:05:37,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:05:37,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:05:37,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:05:37,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:05:37,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:05:37,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:05:37,323 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:05:37,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:05:37,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:05:37,325 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:05:37,326 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:05:37,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:05:37,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:05:37,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:05:37,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:05:37,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:05:37,332 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:05:37,333 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:05:37,334 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:05:37,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:05:37,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:05:37,335 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:05:37,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:05:37,336 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:05:37,336 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:05:37,336 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:05:37,336 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:05:37,338 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:05:37,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:05:37,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:05:37,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:05:37,347 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:05:37,347 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:05:37,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:05:37,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:05:37,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:05:37,347 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:05:37,347 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:05:37,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:05:37,348 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:05:37,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:05:37,348 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:05:37,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:05:37,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:05:37,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:05:37,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:05:37,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:05:37,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:05:37,349 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:05:37,349 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:05:37,350 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:05:37,350 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 04:05:37,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:05:37,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:05:37,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:05:37,532 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:05:37,532 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:05:37,533 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-20 04:05:37,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2a7abba/b09626c82cb244e0946ff93e6976816f/FLAG78ae8097b [2022-03-20 04:05:37,939 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:05:37,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-03-20 04:05:37,943 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2a7abba/b09626c82cb244e0946ff93e6976816f/FLAG78ae8097b [2022-03-20 04:05:37,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2a7abba/b09626c82cb244e0946ff93e6976816f [2022-03-20 04:05:37,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:05:37,954 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:05:37,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:05:37,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:05:37,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:05:37,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:05:37" (1/1) ... [2022-03-20 04:05:37,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39aaf0d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:37, skipping insertion in model container [2022-03-20 04:05:37,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:05:37" (1/1) ... [2022-03-20 04:05:37,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:05:37,970 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:05:38,088 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-20 04:05:38,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:05:38,103 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:05:38,110 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-20 04:05:38,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:05:38,121 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:05:38,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38 WrapperNode [2022-03-20 04:05:38,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:05:38,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:05:38,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:05:38,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:05:38,130 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,135 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,152 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:05:38,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:05:38,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:05:38,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:05:38,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:05:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:38,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 04:05:38,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 04:05:38,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:05:38,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:05:38,214 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:05:38,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:05:38,215 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:05:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:05:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:05:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:05:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:05:38,215 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 04:05:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:05:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:05:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:05:38,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:05:38,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:05:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:05:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:05:38,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:05:38,269 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:05:38,270 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:05:38,371 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:05:38,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:05:38,375 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-03-20 04:05:38,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:05:38 BoogieIcfgContainer [2022-03-20 04:05:38,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:05:38,376 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:05:38,376 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:05:38,377 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:05:38,379 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:05:38" (1/1) ... [2022-03-20 04:05:38,380 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:05:38,542 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 04:05:38,543 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-20 04:05:38,650 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 04:05:38,651 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-20 04:05:38,716 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 04:05:38,717 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_4, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|) (<= .cse0 0)) (and (= v_main_~y~0_4 (+ v_main_~y~0_5 v_main_~z~0_3 (* (- 1) v_main_~z~0_2))) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= (+ v_main_~z~0_3 v_it_3 1) v_main_~z~0_2)) (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_5 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-03-20 04:05:38,780 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 04:05:38,781 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-20 04:05:38,830 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 04:05:38,830 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-20 04:05:38,878 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-03-20 04:05:38,878 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-20 04:05:38,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:05:38 BasicIcfg [2022-03-20 04:05:38,882 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:05:38,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:05:38,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:05:38,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:05:38,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:05:37" (1/4) ... [2022-03-20 04:05:38,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e44fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:05:38, skipping insertion in model container [2022-03-20 04:05:38,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:05:38" (2/4) ... [2022-03-20 04:05:38,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e44fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:05:38, skipping insertion in model container [2022-03-20 04:05:38,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:05:38" (3/4) ... [2022-03-20 04:05:38,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e44fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:05:38, skipping insertion in model container [2022-03-20 04:05:38,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:05:38" (4/4) ... [2022-03-20 04:05:38,891 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.cJordan [2022-03-20 04:05:38,894 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:05:38,895 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:05:38,922 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:05:38,927 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-03-20 04:05:38,927 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:05:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-03-20 04:05:38,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:05:38,939 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:38,940 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:38,940 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-03-20 04:05:38,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:38,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889035052] [2022-03-20 04:05:38,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:38,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:39,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:39,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:39,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889035052] [2022-03-20 04:05:39,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889035052] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:05:39,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:05:39,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:05:39,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012852616] [2022-03-20 04:05:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:05:39,070 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:05:39,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:39,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:05:39,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:05:39,093 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:05:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:39,111 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-03-20 04:05:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:05:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 04:05:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:39,117 INFO L225 Difference]: With dead ends: 25 [2022-03-20 04:05:39,117 INFO L226 Difference]: Without dead ends: 18 [2022-03-20 04:05:39,118 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:05:39,120 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:05:39,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:05:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-03-20 04:05:39,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-03-20 04:05:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:05:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-03-20 04:05:39,142 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-03-20 04:05:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:39,143 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-03-20 04:05:39,143 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:05:39,143 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-03-20 04:05:39,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:05:39,144 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:39,144 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:39,145 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:05:39,145 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:39,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:39,148 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-03-20 04:05:39,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:39,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478863389] [2022-03-20 04:05:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:39,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:39,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478863389] [2022-03-20 04:05:39,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478863389] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:05:39,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:05:39,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 04:05:39,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499215533] [2022-03-20 04:05:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:05:39,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 04:05:39,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:39,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 04:05:39,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-03-20 04:05:39,425 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-20 04:05:39,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:39,556 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2022-03-20 04:05:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:05:39,557 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-20 04:05:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:39,559 INFO L225 Difference]: With dead ends: 33 [2022-03-20 04:05:39,560 INFO L226 Difference]: Without dead ends: 30 [2022-03-20 04:05:39,561 INFO L912 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-20 04:05:39,564 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-20 04:05:39,565 INFO L914 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-20 04:05:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-20 04:05:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-03-20 04:05:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:05:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-20 04:05:39,576 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 17 [2022-03-20 04:05:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:39,576 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-20 04:05:39,576 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-20 04:05:39,577 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-20 04:05:39,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:39,577 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:39,577 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:39,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:05:39,577 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:39,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:39,578 INFO L85 PathProgramCache]: Analyzing trace with hash 34479891, now seen corresponding path program 1 times [2022-03-20 04:05:39,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:39,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798705950] [2022-03-20 04:05:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:39,598 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:39,636 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:39,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:39,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:39,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:39,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798705950] [2022-03-20 04:05:39,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798705950] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:39,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409352118] [2022-03-20 04:05:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:39,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:39,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:39,791 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:05:39,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-03-20 04:05:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:39,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:05:39,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:39,991 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-20 04:05:39,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:05:39,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409352118] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:05:39,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:05:39,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-20 04:05:39,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121304486] [2022-03-20 04:05:39,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:05:39,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:05:39,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:39,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:05:39,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:05:39,995 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-20 04:05:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:40,045 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-03-20 04:05:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:05:40,046 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-20 04:05:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:40,047 INFO L225 Difference]: With dead ends: 32 [2022-03-20 04:05:40,047 INFO L226 Difference]: Without dead ends: 29 [2022-03-20 04:05:40,048 INFO L912 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-20 04:05:40,048 INFO L913 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-20 04:05:40,048 INFO L914 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-20 04:05:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-03-20 04:05:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-03-20 04:05:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:05:40,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-03-20 04:05:40,052 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-03-20 04:05:40,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:40,052 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-03-20 04:05:40,052 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-20 04:05:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-03-20 04:05:40,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:40,053 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:40,053 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:40,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-03-20 04:05:40,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:40,271 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:40,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-03-20 04:05:40,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:40,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97698747] [2022-03-20 04:05:40,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:40,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:40,278 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:40,314 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-20 04:05:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:40,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:40,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97698747] [2022-03-20 04:05:40,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97698747] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:40,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943013161] [2022-03-20 04:05:40,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:40,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:40,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:40,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:05:40,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-03-20 04:05:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:40,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:05:40,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:40,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:40,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:05:44,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:44,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943013161] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:05:44,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:05:44,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-03-20 04:05:44,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332662447] [2022-03-20 04:05:44,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:05:44,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 04:05:44,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:44,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 04:05:44,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-03-20 04:05:44,443 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-20 04:05:44,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:44,587 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2022-03-20 04:05:44,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:05:44,587 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-20 04:05:44,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:44,588 INFO L225 Difference]: With dead ends: 38 [2022-03-20 04:05:44,588 INFO L226 Difference]: Without dead ends: 35 [2022-03-20 04:05:44,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2022-03-20 04:05:44,589 INFO L913 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-20 04:05:44,589 INFO L914 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-20 04:05:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-20 04:05:44,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-03-20 04:05:44,591 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-20 04:05:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-03-20 04:05:44,592 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 18 [2022-03-20 04:05:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:44,592 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-03-20 04:05:44,592 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-20 04:05:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-03-20 04:05:44,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:44,592 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:44,593 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:44,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-20 04:05:44,793 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-03-20 04:05:44,793 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:44,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-03-20 04:05:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:44,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820822410] [2022-03-20 04:05:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:44,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:44,799 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:44,813 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:44,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:44,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:44,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820822410] [2022-03-20 04:05:44,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820822410] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:44,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68971846] [2022-03-20 04:05:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:44,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:44,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:44,908 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:05:44,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-03-20 04:05:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:44,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:05:44,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:45,048 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-20 04:05:45,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:05:45,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68971846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:05:45,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:05:45,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-20 04:05:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893691316] [2022-03-20 04:05:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:05:45,049 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:05:45,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:05:45,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:05:45,049 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-20 04:05:45,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:45,089 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-03-20 04:05:45,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:05:45,090 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-20 04:05:45,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:45,090 INFO L225 Difference]: With dead ends: 34 [2022-03-20 04:05:45,090 INFO L226 Difference]: Without dead ends: 31 [2022-03-20 04:05:45,091 INFO L912 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-20 04:05:45,091 INFO L913 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-20 04:05:45,091 INFO L914 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-20 04:05:45,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-20 04:05:45,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-03-20 04:05:45,093 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-20 04:05:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-03-20 04:05:45,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 18 [2022-03-20 04:05:45,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:45,094 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2022-03-20 04:05:45,094 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-20 04:05:45,094 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2022-03-20 04:05:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:45,094 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:45,094 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:45,114 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-20 04:05:45,310 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:45,310 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:45,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:45,310 INFO L85 PathProgramCache]: Analyzing trace with hash 223241102, now seen corresponding path program 1 times [2022-03-20 04:05:45,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:45,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768046223] [2022-03-20 04:05:45,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:45,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:45,315 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:05:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:45,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:05:45,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:45,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768046223] [2022-03-20 04:05:45,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768046223] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:45,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134443119] [2022-03-20 04:05:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:45,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:45,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:45,441 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:05:45,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-03-20 04:05:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:45,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:05:45,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:45,635 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-20 04:05:45,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:05:45,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134443119] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:05:45,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:05:45,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-03-20 04:05:45,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492872811] [2022-03-20 04:05:45,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:05:45,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:05:45,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:45,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:05:45,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:05:45,637 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-20 04:05:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:45,672 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-03-20 04:05:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:05:45,672 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-20 04:05:45,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:45,673 INFO L225 Difference]: With dead ends: 36 [2022-03-20 04:05:45,673 INFO L226 Difference]: Without dead ends: 33 [2022-03-20 04:05:45,673 INFO L912 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-20 04:05:45,675 INFO L913 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-20 04:05:45,675 INFO L914 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-20 04:05:45,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-03-20 04:05:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-03-20 04:05:45,680 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-20 04:05:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2022-03-20 04:05:45,681 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 18 [2022-03-20 04:05:45,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:45,681 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2022-03-20 04:05:45,681 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-20 04:05:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2022-03-20 04:05:45,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:45,684 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:45,684 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:45,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-20 04:05:45,900 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-20 04:05:45,901 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1522150354, now seen corresponding path program 1 times [2022-03-20 04:05:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:45,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166365290] [2022-03-20 04:05:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:45,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:45,906 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:45,927 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-20 04:05:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:46,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:46,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166365290] [2022-03-20 04:05:46,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166365290] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:46,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131609481] [2022-03-20 04:05:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:46,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:46,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:46,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:05:46,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-03-20 04:05:46,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:46,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:05:46,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:46,165 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-20 04:05:46,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:05:46,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131609481] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:05:46,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:05:46,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-20 04:05:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584194779] [2022-03-20 04:05:46,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:05:46,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:05:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:05:46,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:05:46,170 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-20 04:05:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:46,212 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2022-03-20 04:05:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:05:46,212 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-20 04:05:46,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:46,216 INFO L225 Difference]: With dead ends: 39 [2022-03-20 04:05:46,216 INFO L226 Difference]: Without dead ends: 36 [2022-03-20 04:05:46,216 INFO L912 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-20 04:05:46,217 INFO L913 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-20 04:05:46,217 INFO L914 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-20 04:05:46,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-20 04:05:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-03-20 04:05:46,222 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-20 04:05:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-03-20 04:05:46,223 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 18 [2022-03-20 04:05:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:46,223 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-03-20 04:05:46,223 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-20 04:05:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2022-03-20 04:05:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:46,224 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:46,224 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:46,243 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-20 04:05:46,440 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-20 04:05:46,441 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:46,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:46,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1504591698, now seen corresponding path program 1 times [2022-03-20 04:05:46,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:46,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600259366] [2022-03-20 04:05:46,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:46,445 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-20 04:05:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:46,455 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-20 04:05:46,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:46,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600259366] [2022-03-20 04:05:46,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600259366] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:46,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501152825] [2022-03-20 04:05:46,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:46,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:46,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:46,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:05:46,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-03-20 04:05:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:46,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 04:05:46,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:46,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:05:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:49,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [501152825] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:05:49,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:05:49,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-03-20 04:05:49,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533295592] [2022-03-20 04:05:49,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:05:49,365 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 04:05:49,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:49,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 04:05:49,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=249, Unknown=1, NotChecked=0, Total=306 [2022-03-20 04:05:49,367 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-20 04:05:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:49,846 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2022-03-20 04:05:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:05:49,846 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-20 04:05:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:49,847 INFO L225 Difference]: With dead ends: 49 [2022-03-20 04:05:49,847 INFO L226 Difference]: Without dead ends: 46 [2022-03-20 04:05:49,847 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=127, Invalid=472, Unknown=1, NotChecked=0, Total=600 [2022-03-20 04:05:49,848 INFO L913 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-20 04:05:49,848 INFO L914 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-20 04:05:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-20 04:05:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-03-20 04:05:49,850 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-20 04:05:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2022-03-20 04:05:49,850 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 55 transitions. Word has length 18 [2022-03-20 04:05:49,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:49,850 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 55 transitions. [2022-03-20 04:05:49,850 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-20 04:05:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2022-03-20 04:05:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:05:49,851 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:49,851 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:05:49,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 04:05:50,059 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-20 04:05:50,060 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1095597292, now seen corresponding path program 1 times [2022-03-20 04:05:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122378333] [2022-03-20 04:05:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:50,064 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:50,065 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:50,075 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:50,078 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-20 04:05:50,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:50,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:05:50,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:50,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122378333] [2022-03-20 04:05:50,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122378333] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:50,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437784412] [2022-03-20 04:05:50,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:50,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:50,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:50,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:05:50,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-03-20 04:05:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:50,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:05:50,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:05:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:05:50,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:06:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:01,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437784412] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:06:01,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:06:01,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-03-20 04:06:01,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927135222] [2022-03-20 04:06:01,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:06:01,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-20 04:06:01,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:01,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-20 04:06:01,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=391, Unknown=4, NotChecked=0, Total=506 [2022-03-20 04:06:01,206 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-20 04:06:01,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:01,432 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2022-03-20 04:06:01,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 04:06:01,433 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-20 04:06:01,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:01,433 INFO L225 Difference]: With dead ends: 55 [2022-03-20 04:06:01,433 INFO L226 Difference]: Without dead ends: 51 [2022-03-20 04:06:01,434 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=233, Invalid=819, Unknown=4, NotChecked=0, Total=1056 [2022-03-20 04:06:01,434 INFO L913 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-20 04:06:01,434 INFO L914 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-20 04:06:01,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-20 04:06:01,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-03-20 04:06:01,436 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-20 04:06:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2022-03-20 04:06:01,436 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 19 [2022-03-20 04:06:01,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:01,437 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2022-03-20 04:06:01,437 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-20 04:06:01,437 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2022-03-20 04:06:01,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:01,437 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:01,437 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:01,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 04:06:01,653 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-20 04:06:01,654 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:01,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:01,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-03-20 04:06:01,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:01,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699329826] [2022-03-20 04:06:01,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:01,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:01,658 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:01,660 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:01,669 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:01,676 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:01,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:01,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699329826] [2022-03-20 04:06:01,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699329826] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:01,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977494460] [2022-03-20 04:06:01,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:01,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:01,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:01,780 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:01,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-03-20 04:06:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:01,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:06:01,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:06:01,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:06:01,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977494460] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:01,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:06:01,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-03-20 04:06:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102072692] [2022-03-20 04:06:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:01,915 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:06:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:06:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-20 04:06:01,916 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-20 04:06:01,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:01,956 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2022-03-20 04:06:01,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:06:01,957 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-20 04:06:01,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:01,957 INFO L225 Difference]: With dead ends: 45 [2022-03-20 04:06:01,957 INFO L226 Difference]: Without dead ends: 42 [2022-03-20 04:06:01,958 INFO L912 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-20 04:06:01,958 INFO L913 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-20 04:06:01,958 INFO L914 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-20 04:06:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-03-20 04:06:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-03-20 04:06:01,960 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-20 04:06:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2022-03-20 04:06:01,960 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 19 [2022-03-20 04:06:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:01,960 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2022-03-20 04:06:01,960 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-20 04:06:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2022-03-20 04:06:01,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:01,961 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:01,961 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:01,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-20 04:06:02,163 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-20 04:06:02,164 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:02,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash 61379980, now seen corresponding path program 1 times [2022-03-20 04:06:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:02,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475397640] [2022-03-20 04:06:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:02,167 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:02,168 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:06:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:02,175 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:02,177 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-20 04:06:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:02,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:02,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475397640] [2022-03-20 04:06:02,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475397640] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:02,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092110831] [2022-03-20 04:06:02,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:02,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:02,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:02,280 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:02,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-03-20 04:06:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:02,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:06:02,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:02,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:06:02,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:06:02,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092110831] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:02,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:06:02,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-03-20 04:06:02,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304990487] [2022-03-20 04:06:02,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:02,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:06:02,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:02,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:06:02,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-03-20 04:06:02,439 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-20 04:06:02,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:02,474 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2022-03-20 04:06:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:06:02,474 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-20 04:06:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:02,474 INFO L225 Difference]: With dead ends: 46 [2022-03-20 04:06:02,474 INFO L226 Difference]: Without dead ends: 43 [2022-03-20 04:06:02,474 INFO L912 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-20 04:06:02,475 INFO L913 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-20 04:06:02,475 INFO L914 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-20 04:06:02,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-03-20 04:06:02,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-03-20 04:06:02,476 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-20 04:06:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2022-03-20 04:06:02,477 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 19 [2022-03-20 04:06:02,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:02,477 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-03-20 04:06:02,477 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-20 04:06:02,477 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2022-03-20 04:06:02,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:02,477 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:02,477 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:02,502 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-20 04:06:02,687 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-20 04:06:02,687 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:02,688 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-03-20 04:06:02,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:02,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244441823] [2022-03-20 04:06:02,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:02,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:02,692 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:02,693 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:02,702 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-20 04:06:02,703 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-20 04:06:02,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:02,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:02,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244441823] [2022-03-20 04:06:02,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244441823] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:02,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524043566] [2022-03-20 04:06:02,810 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:06:02,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:02,811 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:02,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-03-20 04:06:02,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:06:02,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:06:02,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:06:02,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:02,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:06:07,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_28_31 Int)) (or (> 0 aux_mod_v_main_~z~0_28_31) (>= aux_mod_v_main_~z~0_28_31 4294967296) (= aux_mod_v_main_~z~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_28_31 Int)) (not (= (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31)) c_main_~z~0)))) (or (and (or (forall ((aux_div_v_main_~z~0_28_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_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31)))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_28_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~z~0_28_31 Int) (aux_div_v_main_~y~0_28_31 Int) (aux_mod_v_main_~y~0_28_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_28_31 4294967296))) (or (<= aux_mod_v_main_~y~0_28_31 0) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_6 (* aux_div_v_main_~y~0_28_31 4294967296) aux_mod_v_main_~y~0_28_31 1) c_main_~y~0))) (<= (+ aux_mod_v_main_~z~0_28_31 .cse1 (* 4294967296 aux_div_v_main_~z~0_28_31) aux_mod_v_main_~y~0_28_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~y~0_28_31) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_28_31 (* aux_div_v_main_~y~0_28_31 4294967296) (* 4294967296 aux_div_v_main_~z~0_28_31) aux_mod_v_main_~y~0_28_31)) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_28_31 (* v_it_6 4294967295)) 4294967296))))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_28_31)))))) (not .cse0)))))) is different from false [2022-03-20 04:06:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-20 04:06:09,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524043566] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:06:09,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:06:09,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 19 [2022-03-20 04:06:09,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794093237] [2022-03-20 04:06:09,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:06:09,918 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:06:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:09,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:06:09,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=239, Unknown=3, NotChecked=32, Total=342 [2022-03-20 04:06:09,918 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-20 04:06:10,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:10,080 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-03-20 04:06:10,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:06:10,080 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-20 04:06:10,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:10,080 INFO L225 Difference]: With dead ends: 50 [2022-03-20 04:06:10,080 INFO L226 Difference]: Without dead ends: 44 [2022-03-20 04:06:10,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=123, Invalid=430, Unknown=3, NotChecked=44, Total=600 [2022-03-20 04:06:10,081 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:10,081 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 70 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 26 Unchecked, 0.1s Time] [2022-03-20 04:06:10,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-20 04:06:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-03-20 04:06:10,083 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-20 04:06:10,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2022-03-20 04:06:10,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 19 [2022-03-20 04:06:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:10,083 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-03-20 04:06:10,083 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-20 04:06:10,084 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2022-03-20 04:06:10,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:10,084 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:10,084 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:10,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-03-20 04:06:10,284 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-20 04:06:10,285 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:10,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:10,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-03-20 04:06:10,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:10,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838015676] [2022-03-20 04:06:10,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:10,289 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:10,289 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:10,304 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-20 04:06:10,306 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:10,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:10,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838015676] [2022-03-20 04:06:10,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838015676] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:10,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837540342] [2022-03-20 04:06:10,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:10,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:10,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:10,449 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:10,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-03-20 04:06:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:10,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:06:10,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:10,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:06:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:23,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837540342] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:06:23,295 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:06:23,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-03-20 04:06:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101705964] [2022-03-20 04:06:23,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:06:23,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-20 04:06:23,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-20 04:06:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=364, Unknown=4, NotChecked=0, Total=462 [2022-03-20 04:06:23,296 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-20 04:06:23,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:23,558 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2022-03-20 04:06:23,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 04:06:23,558 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-20 04:06:23,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:23,558 INFO L225 Difference]: With dead ends: 52 [2022-03-20 04:06:23,558 INFO L226 Difference]: Without dead ends: 48 [2022-03-20 04:06:23,559 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=209, Invalid=779, Unknown=4, NotChecked=0, Total=992 [2022-03-20 04:06:23,559 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:23,559 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 99 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-03-20 04:06:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-20 04:06:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-03-20 04:06:23,561 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-20 04:06:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-03-20 04:06:23,561 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 19 [2022-03-20 04:06:23,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:23,561 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-03-20 04:06:23,562 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-20 04:06:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-03-20 04:06:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:23,562 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:23,562 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:23,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-03-20 04:06:23,775 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-20 04:06:23,775 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:23,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:23,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-03-20 04:06:23,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:23,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287075754] [2022-03-20 04:06:23,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:23,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:23,779 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:06:23,780 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:23,794 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-20 04:06:23,801 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-20 04:06:23,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:23,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:23,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287075754] [2022-03-20 04:06:23,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287075754] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:23,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066637107] [2022-03-20 04:06:23,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:23,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:23,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:23,897 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:23,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-03-20 04:06:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:23,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:06:23,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:24,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:24,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:06:30,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_38_31 Int)) (or (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 (<= (+ 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) (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse1 (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 .cse1) (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))))))))))) (> 0 aux_mod_v_main_~z~0_38_31) (= aux_mod_v_main_~z~0_38_31 (mod c_main_~n~0 4294967296)) (>= aux_mod_v_main_~z~0_38_31 4294967296))) is different from false [2022-03-20 04:06:33,711 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-20 04:06:36,220 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-20 04:06:38,780 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-20 04:06:39,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-20 04:06:39,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066637107] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:06:39,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:06:39,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 19 [2022-03-20 04:06:39,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681363391] [2022-03-20 04:06:39,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:06:39,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:06:39,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:39,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:06:39,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=167, Unknown=6, NotChecked=116, Total=342 [2022-03-20 04:06:39,281 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-20 04:06:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:41,616 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2022-03-20 04:06:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:06:41,616 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-20 04:06:41,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:41,616 INFO L225 Difference]: With dead ends: 50 [2022-03-20 04:06:41,616 INFO L226 Difference]: Without dead ends: 47 [2022-03-20 04:06:41,617 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 24 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=108, Invalid=364, Unknown=6, NotChecked=172, Total=650 [2022-03-20 04:06:41,617 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 33 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:41,617 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 57 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2022-03-20 04:06:41,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-03-20 04:06:41,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-03-20 04:06:41,619 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-20 04:06:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-03-20 04:06:41,622 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-03-20 04:06:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:41,622 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-03-20 04:06:41,623 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-20 04:06:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-03-20 04:06:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:41,623 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:41,623 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:41,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-20 04:06:41,827 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-20 04:06:41,827 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:41,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:41,828 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-03-20 04:06:41,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:41,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131650196] [2022-03-20 04:06:41,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:41,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:41,832 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:06:41,833 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:41,839 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-20 04:06:41,840 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-20 04:06:41,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:41,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:41,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131650196] [2022-03-20 04:06:41,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131650196] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:41,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731014434] [2022-03-20 04:06:41,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:41,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:41,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:41,934 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:41,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-20 04:06:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:41,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:06:41,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:06:42,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:06:42,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731014434] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:42,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:06:42,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-03-20 04:06:42,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672652530] [2022-03-20 04:06:42,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:42,106 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:06:42,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:42,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:06:42,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-03-20 04:06:42,107 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-20 04:06:42,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:42,137 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-03-20 04:06:42,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:06:42,137 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-20 04:06:42,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:42,138 INFO L225 Difference]: With dead ends: 51 [2022-03-20 04:06:42,138 INFO L226 Difference]: Without dead ends: 48 [2022-03-20 04:06:42,138 INFO L912 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-20 04:06:42,138 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 15 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 82 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-20 04:06:42,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 82 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-20 04:06:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-20 04:06:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-03-20 04:06:42,140 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-20 04:06:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-03-20 04:06:42,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-03-20 04:06:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:42,140 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-03-20 04:06:42,140 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-20 04:06:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-03-20 04:06:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:42,141 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:42,141 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:42,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-20 04:06:42,347 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-20 04:06:42,347 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:42,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:42,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1138278570, now seen corresponding path program 1 times [2022-03-20 04:06:42,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:42,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088420456] [2022-03-20 04:06:42,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:42,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:42,351 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,352 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:42,359 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,361 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:42,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:42,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:42,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:42,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088420456] [2022-03-20 04:06:42,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088420456] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:42,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251684231] [2022-03-20 04:06:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:42,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:42,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:42,455 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:42,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-20 04:06:42,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:42,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:06:42,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:06:42,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:06:42,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251684231] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:42,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:06:42,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-03-20 04:06:42,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304000298] [2022-03-20 04:06:42,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:42,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:06:42,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:42,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:06:42,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-03-20 04:06:42,573 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-20 04:06:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:42,618 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-03-20 04:06:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:06:42,618 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-20 04:06:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:42,618 INFO L225 Difference]: With dead ends: 54 [2022-03-20 04:06:42,618 INFO L226 Difference]: Without dead ends: 51 [2022-03-20 04:06:42,619 INFO L912 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-20 04:06:42,619 INFO L913 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-20 04:06:42,619 INFO L914 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-20 04:06:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-20 04:06:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-03-20 04:06:42,621 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-20 04:06:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-03-20 04:06:42,621 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-03-20 04:06:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:42,621 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-03-20 04:06:42,621 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-20 04:06:42,621 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-03-20 04:06:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:42,622 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:42,622 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:42,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-03-20 04:06:42,822 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-20 04:06:42,822 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:42,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:42,823 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-03-20 04:06:42,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:42,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745709682] [2022-03-20 04:06:42,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:42,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:42,826 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,827 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:42,839 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,842 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:42,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:42,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:42,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745709682] [2022-03-20 04:06:42,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745709682] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:42,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818833426] [2022-03-20 04:06:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:42,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:42,960 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-20 04:06:42,961 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-20 04:06:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:42,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:06:42,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:43,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:43,117 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:06:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:49,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [818833426] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:06:49,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:06:49,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-03-20 04:06:49,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266970310] [2022-03-20 04:06:49,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:06:49,143 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 04:06:49,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:49,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 04:06:49,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-03-20 04:06:49,143 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-20 04:06:49,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:49,435 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-03-20 04:06:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 04:06:49,435 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-20 04:06:49,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:49,435 INFO L225 Difference]: With dead ends: 62 [2022-03-20 04:06:49,435 INFO L226 Difference]: Without dead ends: 58 [2022-03-20 04:06:49,436 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2022-03-20 04:06:49,436 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:49,436 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 65 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 127 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-03-20 04:06:49,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-03-20 04:06:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-03-20 04:06:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-20 04:06:49,438 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-03-20 04:06:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:49,438 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-20 04:06:49,438 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-20 04:06:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-20 04:06:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:49,439 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:49,439 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:49,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-03-20 04:06:49,645 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-20 04:06:49,645 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:49,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:49,645 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-03-20 04:06:49,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:49,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305588696] [2022-03-20 04:06:49,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:49,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:49,648 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:49,649 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:49,656 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:49,667 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:49,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:49,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:49,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305588696] [2022-03-20 04:06:49,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305588696] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:49,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690368470] [2022-03-20 04:06:49,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:49,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:49,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:49,766 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-20 04:06:49,766 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-20 04:06:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:49,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:06:49,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:49,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:06:49,940 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:06:49,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690368470] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:49,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:06:49,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-03-20 04:06:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470125322] [2022-03-20 04:06:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:49,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:06:49,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:49,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:06:49,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:06:49,941 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-20 04:06:49,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:49,979 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2022-03-20 04:06:49,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:06:49,979 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-20 04:06:49,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:49,980 INFO L225 Difference]: With dead ends: 51 [2022-03-20 04:06:49,980 INFO L226 Difference]: Without dead ends: 48 [2022-03-20 04:06:49,980 INFO L912 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-20 04:06:49,980 INFO L913 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, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:49,980 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 78 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-20 04:06:49,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-03-20 04:06:49,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-03-20 04:06:49,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:49,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-03-20 04:06:49,986 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-03-20 04:06:49,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:49,987 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-03-20 04:06:49,987 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-20 04:06:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-03-20 04:06:49,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:49,987 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:49,987 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:50,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-20 04:06:50,191 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-20 04:06:50,191 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash -949517359, now seen corresponding path program 1 times [2022-03-20 04:06:50,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:50,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746479717] [2022-03-20 04:06:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:50,194 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:06:50,195 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-20 04:06:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:50,202 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-20 04:06:50,205 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-20 04:06:50,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:50,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:50,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746479717] [2022-03-20 04:06:50,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746479717] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:50,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [593392728] [2022-03-20 04:06:50,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:50,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:50,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:50,301 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-20 04:06:50,302 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-20 04:06:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:50,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:06:50,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:06:50,425 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:06:50,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [593392728] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:06:50,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:06:50,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-20 04:06:50,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274728632] [2022-03-20 04:06:50,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:06:50,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:06:50,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:50,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:06:50,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:06:50,426 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-20 04:06:50,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:50,467 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-03-20 04:06:50,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:06:50,468 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-20 04:06:50,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:50,468 INFO L225 Difference]: With dead ends: 54 [2022-03-20 04:06:50,468 INFO L226 Difference]: Without dead ends: 51 [2022-03-20 04:06:50,468 INFO L912 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-20 04:06:50,469 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:50,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-03-20 04:06:50,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-03-20 04:06:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-03-20 04:06:50,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:06:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-03-20 04:06:50,471 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-03-20 04:06:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:50,471 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-03-20 04:06:50,471 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-20 04:06:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-03-20 04:06:50,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:50,471 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:50,471 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:50,490 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-20 04:06:50,679 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-20 04:06:50,680 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:50,680 INFO L85 PathProgramCache]: Analyzing trace with hash -593960234, now seen corresponding path program 1 times [2022-03-20 04:06:50,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:50,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661420084] [2022-03-20 04:06:50,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:50,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:50,689 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-20 04:06:50,689 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-20 04:06:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:50,698 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-20 04:06:50,702 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-20 04:06:50,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:50,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:50,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:50,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661420084] [2022-03-20 04:06:50,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661420084] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:50,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624830175] [2022-03-20 04:06:50,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:50,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:50,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:50,823 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-20 04:06:50,823 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-20 04:06:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:50,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:06:50,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:51,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:51,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:06:53,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:06:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [624830175] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:06:53,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:06:53,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2022-03-20 04:06:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814760759] [2022-03-20 04:06:53,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:06:53,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:06:53,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:06:53,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:06:53,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2022-03-20 04:06:53,525 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-20 04:06:55,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:06:55,859 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-03-20 04:06:55,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 04:06:55,859 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-20 04:06:55,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:06:55,860 INFO L225 Difference]: With dead ends: 63 [2022-03-20 04:06:55,860 INFO L226 Difference]: Without dead ends: 60 [2022-03-20 04:06:55,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=166, Invalid=588, Unknown=2, NotChecked=0, Total=756 [2022-03-20 04:06:55,861 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:06:55,861 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 123 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-03-20 04:06:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-03-20 04:06:55,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2022-03-20 04:06:55,862 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-20 04:06:55,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-03-20 04:06:55,862 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-03-20 04:06:55,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:06:55,862 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-03-20 04:06:55,862 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-20 04:06:55,863 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-03-20 04:06:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:06:55,863 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:06:55,863 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:06:55,880 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-20 04:06:56,071 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-20 04:06:56,071 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:06:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:06:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash 629018289, now seen corresponding path program 1 times [2022-03-20 04:06:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:06:56,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5870985] [2022-03-20 04:06:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:06:56,074 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-20 04:06:56,075 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-20 04:06:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:56,083 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-20 04:06:56,087 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-20 04:06:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:06:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:56,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:56,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:06:56,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5870985] [2022-03-20 04:06:56,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5870985] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:06:56,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224792305] [2022-03-20 04:06:56,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:06:56,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:06:56,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:06:56,205 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-20 04:06:56,229 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-20 04:06:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:06:56,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:06:56,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:06:56,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:06:56,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:07:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:07:21,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224792305] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:07:21,023 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:07:21,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2022-03-20 04:07:21,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067538845] [2022-03-20 04:07:21,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:07:21,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-20 04:07:21,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:07:21,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-20 04:07:21,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=323, Unknown=7, NotChecked=0, Total=420 [2022-03-20 04:07:21,024 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-20 04:07:23,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:07:23,907 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2022-03-20 04:07:23,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 04:07:23,908 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-20 04:07:23,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:07:23,908 INFO L225 Difference]: With dead ends: 55 [2022-03-20 04:07:23,908 INFO L226 Difference]: Without dead ends: 52 [2022-03-20 04:07:23,909 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=167, Invalid=581, Unknown=8, NotChecked=0, Total=756 [2022-03-20 04:07:23,909 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:07:23,909 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 77 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2022-03-20 04:07:23,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-03-20 04:07:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-03-20 04:07:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-03-20 04:07:23,911 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-03-20 04:07:23,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:07:23,911 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-03-20 04:07:23,911 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-20 04:07:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-03-20 04:07:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:07:23,911 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:07:23,911 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:07:23,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-03-20 04:07:24,133 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-20 04:07:24,134 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:07:24,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:07:24,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005366, now seen corresponding path program 1 times [2022-03-20 04:07:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:07:24,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237529580] [2022-03-20 04:07:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:24,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:07:24,138 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-20 04:07:24,139 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:07:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:24,156 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-20 04:07:24,160 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-20 04:07:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:07:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:07:24,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:07:24,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237529580] [2022-03-20 04:07:24,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237529580] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:07:24,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892461605] [2022-03-20 04:07:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:07:24,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:07:24,497 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-20 04:07:24,498 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-20 04:07:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:24,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:07:24,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:07:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:07:25,450 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:07:33,057 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:07:33,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892461605] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:07:33,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:07:33,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-03-20 04:07:33,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379071612] [2022-03-20 04:07:33,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:07:33,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:07:33,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:07:33,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:07:33,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=273, Unknown=1, NotChecked=0, Total=342 [2022-03-20 04:07:33,058 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 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-20 04:07:35,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:07:35,857 INFO L93 Difference]: Finished difference Result 63 states and 100 transitions. [2022-03-20 04:07:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 04:07:35,857 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 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-20 04:07:35,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:07:35,858 INFO L225 Difference]: With dead ends: 63 [2022-03-20 04:07:35,858 INFO L226 Difference]: Without dead ends: 59 [2022-03-20 04:07:35,858 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=148, Invalid=552, Unknown=2, NotChecked=0, Total=702 [2022-03-20 04:07:35,859 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 52 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:07:35,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 86 Invalid, 0 Unknown, 41 Unchecked, 0.2s Time] [2022-03-20 04:07:35,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-03-20 04:07:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2022-03-20 04:07:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:07:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2022-03-20 04:07:35,861 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 19 [2022-03-20 04:07:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:07:35,861 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2022-03-20 04:07:35,861 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 16 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-20 04:07:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2022-03-20 04:07:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:07:35,861 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:07:35,861 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:07:35,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-03-20 04:07:36,075 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-20 04:07:36,075 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:07:36,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:07:36,076 INFO L85 PathProgramCache]: Analyzing trace with hash -405199023, now seen corresponding path program 1 times [2022-03-20 04:07:36,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:07:36,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141542395] [2022-03-20 04:07:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:36,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:07:36,079 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-20 04:07:36,079 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-20 04:07:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:36,086 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-20 04:07:36,089 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-20 04:07:36,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:07:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:07:36,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:07:36,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141542395] [2022-03-20 04:07:36,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141542395] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:07:36,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2094910504] [2022-03-20 04:07:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:07:36,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:07:36,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:07:36,449 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-20 04:07:36,450 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-20 04:07:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:07:36,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:07:36,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:07:39,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:07:39,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:08:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:08:00,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2094910504] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:08:00,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:08:00,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-03-20 04:08:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120126356] [2022-03-20 04:08:00,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:08:00,962 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-20 04:08:00,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:08:00,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-20 04:08:00,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=330, Unknown=7, NotChecked=0, Total=420 [2022-03-20 04:08:00,963 INFO L87 Difference]: Start difference. First operand 46 states and 74 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-20 04:08:01,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:08:01,742 INFO L93 Difference]: Finished difference Result 66 states and 106 transitions. [2022-03-20 04:08:01,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 04:08:01,742 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-20 04:08:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:08:01,742 INFO L225 Difference]: With dead ends: 66 [2022-03-20 04:08:01,743 INFO L226 Difference]: Without dead ends: 62 [2022-03-20 04:08:01,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 26 SyntacticMatches, 7 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=201, Invalid=722, Unknown=7, NotChecked=0, Total=930 [2022-03-20 04:08:01,743 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 70 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:08:01,743 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 68 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 91 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2022-03-20 04:08:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-03-20 04:08:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 46. [2022-03-20 04:08:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.7073170731707317) internal successors, (70), 41 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:08:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 74 transitions. [2022-03-20 04:08:01,745 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 74 transitions. Word has length 19 [2022-03-20 04:08:01,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:08:01,745 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 74 transitions. [2022-03-20 04:08:01,745 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-20 04:08:01,745 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 74 transitions. [2022-03-20 04:08:01,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-03-20 04:08:01,745 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:08:01,745 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:08:01,762 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-20 04:08:01,951 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-20 04:08:01,951 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:08:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:08:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2144376817, now seen corresponding path program 1 times [2022-03-20 04:08:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:08:01,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538962545] [2022-03-20 04:08:01,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:08:01,954 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-20 04:08:01,955 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-20 04:08:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:01,963 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-20 04:08:01,965 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-20 04:08:02,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:08:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:08:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:08:02,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538962545] [2022-03-20 04:08:02,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538962545] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:08:02,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128616632] [2022-03-20 04:08:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:08:02,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:08:02,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:08:02,333 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-20 04:08:02,334 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-20 04:08:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:08:02,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 04:08:02,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:08:05,040 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-20 04:08:07,206 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-20 04:08:07,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-03-20 04:08:07,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:08:39,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:08:39,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128616632] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:08:39,179 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:08:39,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-03-20 04:08:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226316789] [2022-03-20 04:08:39,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:08:39,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-03-20 04:08:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:08:39,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-03-20 04:08:39,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=422, Unknown=13, NotChecked=90, Total=650 [2022-03-20 04:08:39,180 INFO L87 Difference]: Start difference. First operand 46 states and 74 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-20 04:08:41,394 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-20 04:08:43,420 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-20 04:08:58,469 WARN L232 SmtUtils]: Spent 6.54s on a formula simplification. DAG size of input: 86 DAG size of output: 83 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:09:08,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:09:08,298 INFO L93 Difference]: Finished difference Result 76 states and 126 transitions. [2022-03-20 04:09:08,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-20 04:09:08,298 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-20 04:09:08,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:09:08,299 INFO L225 Difference]: With dead ends: 76 [2022-03-20 04:09:08,299 INFO L226 Difference]: Without dead ends: 72 [2022-03-20 04:09:08,299 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 62.2s TimeCoverageRelationStatistics Valid=323, Invalid=1076, Unknown=23, NotChecked=300, Total=1722 [2022-03-20 04:09:08,300 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:09:08,300 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 64 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 101 Invalid, 0 Unknown, 160 Unchecked, 0.2s Time] [2022-03-20 04:09:08,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-03-20 04:09:08,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 51. [2022-03-20 04:09:08,301 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-20 04:09:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2022-03-20 04:09:08,301 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 19 [2022-03-20 04:09:08,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:09:08,302 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2022-03-20 04:09:08,302 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-20 04:09:08,302 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2022-03-20 04:09:08,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:09:08,302 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:09:08,302 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:09:08,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-03-20 04:09:08,506 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-20 04:09:08,506 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:09:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:09:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash -369501645, now seen corresponding path program 2 times [2022-03-20 04:09:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:09:08,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430599197] [2022-03-20 04:09:08,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:09:08,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:09:08,510 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:08,511 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:08,511 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:08,520 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:09:08,522 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-20 04:09:08,523 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-20 04:09:08,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:09:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:09:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:09:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:09:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430599197] [2022-03-20 04:09:08,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430599197] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:09:08,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919517573] [2022-03-20 04:09:08,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:09:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:09:08,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:09:08,813 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-20 04:09:08,814 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-20 04:09:08,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:09:08,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:09:08,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 04:09:08,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:09:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:09:09,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:09:18,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_65_31 Int)) (or (>= aux_mod_v_main_~z~0_65_31 4294967296) (> 0 aux_mod_v_main_~z~0_65_31) (= aux_mod_v_main_~z~0_65_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_65_31 Int)) (not (= (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)) c_main_~z~0)))) (or (and (or (forall ((aux_div_v_main_~z~0_65_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_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_65_31 (* 4294967296 aux_div_v_main_~z~0_65_31)))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_65_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~z~0_65_31 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) (<= (+ 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) (+ c_main_~y~0 c_main_~z~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))))) (<= 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 (<= (+ v_it_6 c_main_~y~0 c_main_~z~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)) (not (< 0 (mod (+ aux_mod_v_main_~y~0_65_31 (* v_it_6 4294967295)) 4294967296))) (<= 1 v_it_6))))))) (not .cse0)))))) is different from false [2022-03-20 04:10:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-03-20 04:10:03,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919517573] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:10:03,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:10:03,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2022-03-20 04:10:03,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646962202] [2022-03-20 04:10:03,650 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:10:03,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-03-20 04:10:03,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:10:03,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-03-20 04:10:03,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=323, Unknown=9, NotChecked=38, Total=462 [2022-03-20 04:10:03,650 INFO L87 Difference]: Start difference. First operand 51 states and 83 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-20 04:10:04,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:10:04,095 INFO L93 Difference]: Finished difference Result 67 states and 108 transitions. [2022-03-20 04:10:04,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:10:04,096 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-20 04:10:04,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:10:04,096 INFO L225 Difference]: With dead ends: 67 [2022-03-20 04:10:04,096 INFO L226 Difference]: Without dead ends: 61 [2022-03-20 04:10:04,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 26.5s TimeCoverageRelationStatistics Valid=155, Invalid=542, Unknown=9, NotChecked=50, Total=756 [2022-03-20 04:10:04,097 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 04:10:04,097 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 94 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 125 Invalid, 0 Unknown, 56 Unchecked, 0.2s Time] [2022-03-20 04:10:04,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-03-20 04:10:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-03-20 04:10:04,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 48 states have internal predecessors, (82), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:10:04,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 86 transitions. [2022-03-20 04:10:04,099 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 86 transitions. Word has length 20 [2022-03-20 04:10:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:10:04,099 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 86 transitions. [2022-03-20 04:10:04,099 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-20 04:10:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 86 transitions. [2022-03-20 04:10:04,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:10:04,099 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:10:04,099 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:10:04,117 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-20 04:10:04,307 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-20 04:10:04,307 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:10:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:10:04,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2118261262, now seen corresponding path program 1 times [2022-03-20 04:10:04,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:10:04,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329872706] [2022-03-20 04:10:04,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:10:04,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:10:04,311 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:04,311 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:04,312 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:04,330 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:04,332 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.5))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:04,333 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.6))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:10:04,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:04,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:10:04,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:10:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329872706] [2022-03-20 04:10:04,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329872706] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:10:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713793296] [2022-03-20 04:10:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:10:04,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:10:04,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:10:04,682 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-20 04:10:04,683 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-20 04:10:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:04,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:10:04,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:10:05,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:10:05,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:10:17,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 04:10:17,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713793296] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:10:17,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:10:17,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-03-20 04:10:17,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510530654] [2022-03-20 04:10:17,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:10:17,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-20 04:10:17,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:10:17,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-20 04:10:17,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=391, Unknown=4, NotChecked=0, Total=506 [2022-03-20 04:10:17,511 INFO L87 Difference]: Start difference. First operand 53 states and 86 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-20 04:10:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:10:18,303 INFO L93 Difference]: Finished difference Result 79 states and 125 transitions. [2022-03-20 04:10:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-20 04:10:18,304 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-20 04:10:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:10:18,304 INFO L225 Difference]: With dead ends: 79 [2022-03-20 04:10:18,304 INFO L226 Difference]: Without dead ends: 75 [2022-03-20 04:10:18,305 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=252, Invalid=866, Unknown=4, NotChecked=0, Total=1122 [2022-03-20 04:10:18,305 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 04:10:18,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 120 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 195 Invalid, 0 Unknown, 38 Unchecked, 0.3s Time] [2022-03-20 04:10:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-03-20 04:10:18,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2022-03-20 04:10:18,307 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-20 04:10:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 85 transitions. [2022-03-20 04:10:18,308 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 85 transitions. Word has length 20 [2022-03-20 04:10:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:10:18,308 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 85 transitions. [2022-03-20 04:10:18,308 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-20 04:10:18,308 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 85 transitions. [2022-03-20 04:10:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:10:18,308 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:10:18,308 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:10:18,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-03-20 04:10:18,519 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-20 04:10:18,519 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:10:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:10:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1929500051, now seen corresponding path program 1 times [2022-03-20 04:10:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:10:18,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007846670] [2022-03-20 04:10:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:10:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:10:18,523 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:18,524 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:10:18,524 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_11 .cse0 (* (- 4294967296) (div (+ main_~y~0_11 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:18,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:18,533 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:10:18,535 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:10:18,537 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-20 04:10:18,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:10:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:18,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:10:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:10:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007846670] [2022-03-20 04:10:18,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007846670] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:10:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459068781] [2022-03-20 04:10:18,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:10:18,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:10:18,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:10:18,844 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-20 04:10:18,845 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-20 04:10:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:10:18,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-20 04:10:18,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:10:19,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:10:19,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:10:49,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_77_31 Int) (aux_mod_main_~z~0_26 Int)) (or (< 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) (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 (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_75_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not .cse0)) (or .cse0 (forall ((aux_div_v_main_~y~0_75_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31) c_main_~y~0)))))) (< aux_mod_v_main_~y~0_75_31 0) (< 0 aux_mod_v_main_~y~0_75_31)))) (forall ((aux_mod_v_main_~y~0_75_31 Int) (aux_div_v_main_~z~0_77_31 Int) (aux_div_main_~z~0_26 Int)) (or (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~y~0_75_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31))) (exists ((v_it_4 Int)) (and (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31)) (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4))))) (not .cse1)) (or .cse1 (forall ((aux_div_v_main_~y~0_75_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_75_31 4294967296) aux_mod_v_main_~y~0_75_31) c_main_~y~0)))))) (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) (<= 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)))))))) is different from false [2022-03-20 04:11:03,950 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-20 04:11:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-03-20 04:11:26,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459068781] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:11:26,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:11:26,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2022-03-20 04:11:26,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589825233] [2022-03-20 04:11:26,174 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:11:26,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-03-20 04:11:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:11:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-03-20 04:11:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=366, Unknown=5, NotChecked=82, Total=552 [2022-03-20 04:11:26,175 INFO L87 Difference]: Start difference. First operand 52 states and 85 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-20 04:11:33,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:11:33,021 INFO L93 Difference]: Finished difference Result 68 states and 110 transitions. [2022-03-20 04:11:33,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 04:11:33,021 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-20 04:11:33,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:11:33,022 INFO L225 Difference]: With dead ends: 68 [2022-03-20 04:11:33,022 INFO L226 Difference]: Without dead ends: 65 [2022-03-20 04:11:33,022 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=186, Invalid=687, Unknown=5, NotChecked=114, Total=992 [2022-03-20 04:11:33,022 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 72 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:11:33,022 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 77 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 88 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-03-20 04:11:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-03-20 04:11:33,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 54. [2022-03-20 04:11:33,024 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-20 04:11:33,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 89 transitions. [2022-03-20 04:11:33,024 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 89 transitions. Word has length 20 [2022-03-20 04:11:33,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:11:33,024 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 89 transitions. [2022-03-20 04:11:33,024 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-20 04:11:33,024 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 89 transitions. [2022-03-20 04:11:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:11:33,025 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:11:33,025 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:11:33,045 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-20 04:11:33,243 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-20 04:11:33,243 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:11:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:11:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1592480168, now seen corresponding path program 1 times [2022-03-20 04:11:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:11:33,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571273573] [2022-03-20 04:11:33,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:11:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:11:33,246 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:33,247 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:11:33,248 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.2))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:33,261 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:33,262 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:11:33,263 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-20 04:11:33,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:11:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:33,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:11:33,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:11:33,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571273573] [2022-03-20 04:11:33,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571273573] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:11:33,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019170765] [2022-03-20 04:11:33,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:11:33,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:11:33,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:11:33,532 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-20 04:11:33,532 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-20 04:11:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:33,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:11:33,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:11:33,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-03-20 04:11:33,888 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:11:33,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019170765] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:11:33,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:11:33,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 18 [2022-03-20 04:11:33,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887395310] [2022-03-20 04:11:33,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:11:33,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:11:33,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:11:33,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:11:33,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-03-20 04:11:33,889 INFO L87 Difference]: Start difference. First operand 54 states and 89 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-20 04:11:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:11:33,998 INFO L93 Difference]: Finished difference Result 69 states and 110 transitions. [2022-03-20 04:11:33,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:11:33,998 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-20 04:11:33,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:11:33,999 INFO L225 Difference]: With dead ends: 69 [2022-03-20 04:11:33,999 INFO L226 Difference]: Without dead ends: 66 [2022-03-20 04:11:33,999 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-03-20 04:11:33,999 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 18 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:11:33,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-20 04:11:34,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-20 04:11:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2022-03-20 04:11:34,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.711111111111111) internal successors, (77), 45 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:11:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 81 transitions. [2022-03-20 04:11:34,001 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 81 transitions. Word has length 20 [2022-03-20 04:11:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:11:34,001 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 81 transitions. [2022-03-20 04:11:34,001 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-20 04:11:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 81 transitions. [2022-03-20 04:11:34,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:11:34,001 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:11:34,001 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:11:34,017 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-20 04:11:34,202 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-20 04:11:34,202 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:11:34,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:11:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash -2096941357, now seen corresponding path program 2 times [2022-03-20 04:11:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:11:34,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701252898] [2022-03-20 04:11:34,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:11:34,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:11:34,205 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:34,206 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:34,206 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:34,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:34,213 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-20 04:11:34,215 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:11:34,216 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-20 04:11:34,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:11:34,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:11:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:11:34,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:11:34,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701252898] [2022-03-20 04:11:34,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701252898] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:11:34,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863139831] [2022-03-20 04:11:34,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:11:34,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:11:34,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:11:34,479 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-20 04:11:34,480 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-20 04:11:34,505 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:11:34,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:11:34,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-20 04:11:34,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:11:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:11:34,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:11:48,587 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-20 04:14:04,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-03-20 04:14:04,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863139831] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:14:04,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:14:04,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 20 [2022-03-20 04:14:04,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88426307] [2022-03-20 04:14:04,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:14:04,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 04:14:04,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:14:04,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 04:14:04,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=250, Unknown=22, NotChecked=34, Total=380 [2022-03-20 04:14:04,391 INFO L87 Difference]: Start difference. First operand 50 states and 81 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-20 04:14:38,783 WARN L232 SmtUtils]: Spent 25.58s on a formula simplification that was a NOOP. DAG size: 100 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:14:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:14:45,588 INFO L93 Difference]: Finished difference Result 73 states and 116 transitions. [2022-03-20 04:14:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 04:14:45,588 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-20 04:14:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:14:45,589 INFO L225 Difference]: With dead ends: 73 [2022-03-20 04:14:45,589 INFO L226 Difference]: Without dead ends: 66 [2022-03-20 04:14:45,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 98.7s TimeCoverageRelationStatistics Valid=144, Invalid=534, Unknown=28, NotChecked=50, Total=756 [2022-03-20 04:14:45,590 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 04:14:45,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 57 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 30 Unchecked, 0.3s Time] [2022-03-20 04:14:45,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-03-20 04:14:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2022-03-20 04:14:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.6862745098039216) internal successors, (86), 51 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-20 04:14:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 90 transitions. [2022-03-20 04:14:45,591 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 90 transitions. Word has length 20 [2022-03-20 04:14:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:14:45,592 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 90 transitions. [2022-03-20 04:14:45,592 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-20 04:14:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 90 transitions. [2022-03-20 04:14:45,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 04:14:45,592 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:14:45,592 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:14:45,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-03-20 04:14:45,803 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-20 04:14:45,804 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:14:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:14:45,804 INFO L85 PathProgramCache]: Analyzing trace with hash 641395694, now seen corresponding path program 2 times [2022-03-20 04:14:45,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:14:45,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909007023] [2022-03-20 04:14:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:14:45,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:14:45,807 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:14:45,808 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-03-20 04:14:45,809 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_13 .cse0 (* (- 4294967296) (div (+ main_~y~0_13 .cse0) 4294967296)))) 0)) [2022-03-20 04:14:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:14:45,830 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-20 04:14:45,833 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-20 04:14:45,834 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-20 04:14:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:14:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:14:46,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:14:46,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:14:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909007023] [2022-03-20 04:14:46,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909007023] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:14:46,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [209841533] [2022-03-20 04:14:46,296 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:14:46,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:14:46,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:14:46,297 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-20 04:14:46,298 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-20 04:14:46,324 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:14:46,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:14:46,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 04:14:46,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:14:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:14:46,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:15:06,785 WARN L855 $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 (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 .cse0)))) is different from true [2022-03-20 04:18:22,569 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