/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-de41.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 04:01:29,370 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:01:29,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:01:29,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:01:29,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:01:29,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:01:29,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:01:29,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:01:29,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:01:29,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:01:29,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:01:29,407 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:01:29,407 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:01:29,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:01:29,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:01:29,410 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:01:29,410 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:01:29,411 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:01:29,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:01:29,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:01:29,421 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:01:29,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:01:29,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:01:29,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:01:29,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:01:29,426 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:01:29,427 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:01:29,427 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:01:29,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:01:29,428 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:01:29,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:01:29,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:01:29,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:01:29,429 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:01:29,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:01:29,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:01:29,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:01:29,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:01:29,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:01:29,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:01:29,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:01:29,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:01:29,441 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:01:29,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:01:29,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:01:29,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:01:29,453 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:01:29,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:01:29,453 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:01:29,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:01:29,454 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:01:29,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:01:29,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:01:29,454 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:01:29,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:01:29,455 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:01:29,455 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:01:29,457 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:01:29,457 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:01:29,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:01:29,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:01:29,683 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:01:29,684 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:01:29,685 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:01:29,686 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-03-20 04:01:29,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bab06139/e717426ddc2b40e1825d5136986ddd8d/FLAG6d82abf56 [2022-03-20 04:01:30,069 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:01:30,070 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de41.c [2022-03-20 04:01:30,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bab06139/e717426ddc2b40e1825d5136986ddd8d/FLAG6d82abf56 [2022-03-20 04:01:30,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4bab06139/e717426ddc2b40e1825d5136986ddd8d [2022-03-20 04:01:30,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:01:30,494 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:01:30,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:01:30,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:01:30,503 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:01:30,503 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,504 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32c96c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30, skipping insertion in model container [2022-03-20 04:01:30,504 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:01:30,519 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:01:30,648 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-de41.c[368,381] [2022-03-20 04:01:30,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:01:30,666 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:01:30,675 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-de41.c[368,381] [2022-03-20 04:01:30,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:01:30,688 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:01:30,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30 WrapperNode [2022-03-20 04:01:30,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:01:30,690 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:01:30,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:01:30,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:01:30,697 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,705 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,711 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:01:30,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:01:30,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:01:30,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:01:30,713 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:01:30,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:01:30,736 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:01:30,739 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:01:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:01:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:01:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:01:30,769 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:01:30,769 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:01:30,769 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:01:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:01:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:01:30,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:01:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 04:01:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:01:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:01:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:01:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:01:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:01:30,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:01:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:01:30,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:01:30,820 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:01:30,821 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:01:30,899 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:01:30,903 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:01:30,903 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-20 04:01:30,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:01:30 BoogieIcfgContainer [2022-03-20 04:01:30,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:01:30,905 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:01:30,905 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:01:30,916 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:01:30,918 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:01:30" (1/1) ... [2022-03-20 04:01:30,919 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:01:31,078 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:01:31,079 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_5 (+ v_main_~y~0_6 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0) (= v_main_~y~0_6 v_main_~y~0_5)) (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_6 v_it_1 1) v_main_~y~0_5)))) (< v_main_~y~0_6 v_main_~y~0_5) (< 0 .cse0) (= v_main_~x~0_3 (+ v_main_~x~0_4 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-03-20 04:01:31,213 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:01:31,213 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_7 (+ v_main_~z~0_6 1)) (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_7 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_7} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_6, 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_7 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (= v_main_~z~0_7 v_main_~z~0_6) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= |v_main_#t~post8_3| |v_main_#t~post8_1|) (<= .cse0 0)) (and (< v_main_~x~0_9 v_main_~x~0_8) (= v_main_~z~0_6 (+ (* (- 1) v_main_~x~0_8) v_main_~x~0_9 v_main_~z~0_7)) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~x~0_9 v_it_2 1) v_main_~x~0_8)) (< 0 (mod (+ v_main_~z~0_7 (* v_it_2 4294967295)) 4294967296)))) (< 0 .cse0)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_7, 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_6, 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:01:31,283 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:01:31,284 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_4 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_4 (+ v_main_~y~0_3 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_4} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_3, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_4 4294967296))) (or (and (= (+ (* (- 1) v_main_~y~0_3) v_main_~y~0_4 v_main_~z~0_3) v_main_~z~0_2) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_4 (* v_it_3 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_3 v_it_3 1) v_main_~y~0_4)))) (< v_main_~y~0_3 v_main_~y~0_4)) (and (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= v_main_~y~0_4 v_main_~y~0_3) (<= .cse0 0) (= |v_main_#t~post9_3| |v_main_#t~post9_1|)))) InVars {main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_3, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-03-20 04:01:31,345 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:01:31,345 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= (+ v_main_~y~0_8 1) v_main_~y~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_8} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_7, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (< v_main_~x~0_6 v_main_~x~0_7) (= (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~y~0_8) v_main_~y~0_7)) (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~y~0_8 v_main_~y~0_7) (= v_main_~x~0_7 v_main_~x~0_6)))) InVars {main_~y~0=v_main_~y~0_8, main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-03-20 04:01:31,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:01:31 BasicIcfg [2022-03-20 04:01:31,352 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:01:31,354 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:01:31,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:01:31,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:01:31,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:01:30" (1/4) ... [2022-03-20 04:01:31,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34af9882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:01:31, skipping insertion in model container [2022-03-20 04:01:31,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:01:30" (2/4) ... [2022-03-20 04:01:31,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34af9882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:01:31, skipping insertion in model container [2022-03-20 04:01:31,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:01:30" (3/4) ... [2022-03-20 04:01:31,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34af9882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:01:31, skipping insertion in model container [2022-03-20 04:01:31,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:01:31" (4/4) ... [2022-03-20 04:01:31,361 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de41.cJordan [2022-03-20 04:01:31,367 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:01:31,367 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:01:31,399 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:01:31,403 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:01:31,404 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:01:31,412 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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:01:31,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-20 04:01:31,416 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:01:31,417 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:01:31,417 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:01:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:01:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2015447748, now seen corresponding path program 1 times [2022-03-20 04:01:31,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:01:31,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952082825] [2022-03-20 04:01:31,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:31,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:01:31,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:01:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:31,547 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:01:31,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:01:31,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952082825] [2022-03-20 04:01:31,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952082825] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:01:31,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:01:31,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:01:31,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719279750] [2022-03-20 04:01:31,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:01:31,556 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:01:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:01:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:01:31,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:01:31,582 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:01:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:01:31,611 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-03-20 04:01:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:01:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 15 [2022-03-20 04:01:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:01:31,619 INFO L225 Difference]: With dead ends: 23 [2022-03-20 04:01:31,619 INFO L226 Difference]: Without dead ends: 16 [2022-03-20 04:01:31,620 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:01:31,623 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 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:01:31,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 04:01:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-20 04:01:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-03-20 04:01:31,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 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:01:31,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-03-20 04:01:31,648 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-03-20 04:01:31,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:01:31,648 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-03-20 04:01:31,649 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:01:31,649 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-03-20 04:01:31,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-20 04:01:31,649 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:01:31,649 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:01:31,649 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:01:31,650 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:01:31,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:01:31,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1389121438, now seen corresponding path program 1 times [2022-03-20 04:01:31,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:01:31,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429096014] [2022-03-20 04:01:31,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:31,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:01:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:01:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:31,920 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:01:31,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:01:31,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429096014] [2022-03-20 04:01:31,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429096014] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:01:31,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:01:31,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 04:01:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227744128] [2022-03-20 04:01:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:01:31,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:01:31,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:01:31,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:01:31,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-03-20 04:01:31,923 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:01:32,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:01:32,053 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-03-20 04:01:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:01:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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 15 [2022-03-20 04:01:32,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:01:32,054 INFO L225 Difference]: With dead ends: 27 [2022-03-20 04:01:32,054 INFO L226 Difference]: Without dead ends: 24 [2022-03-20 04:01:32,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 04:01:32,056 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:01:32,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 42 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 59 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-03-20 04:01:32,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-20 04:01:32,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-03-20 04:01:32,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.4375) internal successors, (23), 16 states have internal predecessors, (23), 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:01:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-03-20 04:01:32,060 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 15 [2022-03-20 04:01:32,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:01:32,060 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-03-20 04:01:32,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 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:01:32,060 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-03-20 04:01:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:01:32,061 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:01:32,061 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:01:32,061 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:01:32,061 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:01:32,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:01:32,062 INFO L85 PathProgramCache]: Analyzing trace with hash 139812261, now seen corresponding path program 1 times [2022-03-20 04:01:32,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:01:32,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19778258] [2022-03-20 04:01:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:32,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:01:32,073 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:01:32,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:32,115 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:01:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:01:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:32,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:01:32,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:01:32,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19778258] [2022-03-20 04:01:32,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19778258] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:01:32,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461621309] [2022-03-20 04:01:32,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:32,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:01:32,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:01:32,246 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:01:32,266 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:01:32,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:32,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:01:32,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:01:32,565 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:01:32,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:01:32,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461621309] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:01:32,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:01:32,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-03-20 04:01:32,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899138910] [2022-03-20 04:01:32,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:01:32,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:01:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:01:32,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:01:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2022-03-20 04:01:32,575 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:01:32,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:01:32,623 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2022-03-20 04:01:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:01:32,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 16 [2022-03-20 04:01:32,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:01:32,624 INFO L225 Difference]: With dead ends: 26 [2022-03-20 04:01:32,624 INFO L226 Difference]: Without dead ends: 19 [2022-03-20 04:01:32,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:01:32,625 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:01:32,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-03-20 04:01:32,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-03-20 04:01:32,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-03-20 04:01:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 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:01:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-03-20 04:01:32,628 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 16 [2022-03-20 04:01:32,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:01:32,628 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-03-20 04:01:32,628 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:01:32,628 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-03-20 04:01:32,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:01:32,629 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:01:32,629 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:01:32,649 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:01:32,831 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:01:32,832 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:01:32,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:01:32,832 INFO L85 PathProgramCache]: Analyzing trace with hash -894405051, now seen corresponding path program 1 times [2022-03-20 04:01:32,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:01:32,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977771203] [2022-03-20 04:01:32,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:32,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:01:32,839 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:01:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:32,867 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:01:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:01:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:32,979 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:01:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:01:32,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977771203] [2022-03-20 04:01:32,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977771203] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:01:32,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191215530] [2022-03-20 04:01:32,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:32,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:01:32,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:01:32,984 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:01:32,985 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:01:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:33,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-03-20 04:01:33,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:01:33,144 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:01:33,144 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:01:33,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191215530] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:01:33,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:01:33,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 13 [2022-03-20 04:01:33,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032876454] [2022-03-20 04:01:33,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:01:33,146 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:01:33,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:01:33,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:01:33,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-03-20 04:01:33,147 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:01:33,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:01:33,173 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-03-20 04:01:33,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:01:33,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 16 [2022-03-20 04:01:33,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:01:33,176 INFO L225 Difference]: With dead ends: 25 [2022-03-20 04:01:33,176 INFO L226 Difference]: Without dead ends: 22 [2022-03-20 04:01:33,176 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:01:33,179 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:01:33,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 67 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-03-20 04:01:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-03-20 04:01:33,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-03-20 04:01:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 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:01:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-03-20 04:01:33,187 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2022-03-20 04:01:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:01:33,188 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-03-20 04:01:33,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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:01:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-03-20 04:01:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:01:33,191 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:01:33,194 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:01:33,214 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:01:33,415 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:01:33,416 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:01:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:01:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1590526661, now seen corresponding path program 1 times [2022-03-20 04:01:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:01:33,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040535540] [2022-03-20 04:01:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:33,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:01:33,421 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:01:33,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:33,435 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:01:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:01:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:33,561 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:01:33,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:01:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040535540] [2022-03-20 04:01:33,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040535540] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:01:33,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821428523] [2022-03-20 04:01:33,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:33,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:01:33,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:01:33,563 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:01:33,564 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:01:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:33,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:01:33,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:01:38,077 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:01:38,078 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:01:43,538 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:01:43,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821428523] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:01:43,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:01:43,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2022-03-20 04:01:43,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110500667] [2022-03-20 04:01:43,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:01:43,540 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 04:01:43,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:01:43,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 04:01:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=210, Unknown=2, NotChecked=0, Total=272 [2022-03-20 04:01:43,541 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 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:01:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:01:43,765 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-03-20 04:01:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 04:01:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 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 16 [2022-03-20 04:01:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:01:43,767 INFO L225 Difference]: With dead ends: 37 [2022-03-20 04:01:43,768 INFO L226 Difference]: Without dead ends: 33 [2022-03-20 04:01:43,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=139, Invalid=459, Unknown=2, NotChecked=0, Total=600 [2022-03-20 04:01:43,768 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:01:43,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 52 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 68 Invalid, 0 Unknown, 44 Unchecked, 0.1s Time] [2022-03-20 04:01:43,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-03-20 04:01:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2022-03-20 04:01:43,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 22 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:01:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2022-03-20 04:01:43,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 16 [2022-03-20 04:01:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:01:43,773 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-03-20 04:01:43,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 14 states have internal predecessors, (25), 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:01:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-03-20 04:01:43,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:01:43,773 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:01:43,773 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:01:43,799 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:01:43,975 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:01:43,975 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:01:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:01:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1930032162, now seen corresponding path program 1 times [2022-03-20 04:01:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:01:43,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482158840] [2022-03-20 04:01:43,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:43,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:01:43,985 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:01:43,988 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:01:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:44,015 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:01:44,022 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.4))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-20 04:01:44,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:01:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:44,167 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:01:44,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:01:44,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482158840] [2022-03-20 04:01:44,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482158840] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:01:44,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493851271] [2022-03-20 04:01:44,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:44,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:01:44,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:01:44,169 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:01:44,170 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:01:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:44,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:01:44,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:01:44,344 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:01:44,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:01:52,476 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((aux_mod_v_main_~y~0_17_31 Int)) (or (>= aux_mod_v_main_~y~0_17_31 4294967296) (= (mod c_main_~n~0 4294967296) aux_mod_v_main_~y~0_17_31) (let ((.cse2 (< 0 (mod c_main_~z~0 4294967296))) (.cse0 (forall ((aux_div_v_main_~y~0_17_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_17_31 4294967296) aux_mod_v_main_~y~0_17_31) c_main_~y~0))))) (and (or (let ((.cse1 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 .cse1) (or (forall ((aux_div_v_main_~y~0_17_31 Int)) (or (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_17_31 4294967296) aux_mod_v_main_~y~0_17_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_17_31 4294967296) aux_mod_v_main_~y~0_17_31)) (<= 1 v_it_4))))) (not .cse1)))) .cse2) (or (not .cse2) (and (or .cse0 (forall ((aux_mod_v_main_~x~0_17_31 Int) (aux_div_v_main_~x~0_17_31 Int)) (or (<= (+ aux_mod_v_main_~x~0_17_31 (* aux_div_v_main_~x~0_17_31 4294967296)) c_main_~x~0) (< aux_mod_v_main_~x~0_17_31 0) (exists ((v_it_2 Int)) (and (<= (+ v_it_2 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_17_31 (* aux_div_v_main_~x~0_17_31 4294967296))) (<= 1 v_it_2) (not (< 0 (mod (+ (* v_it_2 4294967295) c_main_~z~0) 4294967296))))) (< 0 aux_mod_v_main_~x~0_17_31)))) (forall ((aux_mod_v_main_~x~0_17_31 Int) (aux_div_v_main_~x~0_17_31 Int) (aux_div_v_main_~y~0_17_31 Int)) (or (<= (+ aux_mod_v_main_~x~0_17_31 (* aux_div_v_main_~x~0_17_31 4294967296)) c_main_~x~0) (<= aux_mod_v_main_~x~0_17_31 0) (exists ((v_it_2 Int)) (and (<= (+ v_it_2 c_main_~x~0 1) (+ aux_mod_v_main_~x~0_17_31 (* aux_div_v_main_~x~0_17_31 4294967296))) (<= 1 v_it_2) (not (< 0 (mod (+ (* v_it_2 4294967295) c_main_~z~0) 4294967296))))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) aux_mod_v_main_~x~0_17_31) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_17_31 4294967296) aux_mod_v_main_~y~0_17_31)) (<= 1 v_it_4))) (<= 4294967296 aux_mod_v_main_~x~0_17_31) (<= (+ (* aux_div_v_main_~y~0_17_31 4294967296) aux_mod_v_main_~y~0_17_31) c_main_~y~0))))))) (> 0 aux_mod_v_main_~y~0_17_31))) (< 0 (mod c_main_~y~0 4294967296))) is different from true [2022-03-20 04:01:52,660 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:01:52,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493851271] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:01:52,661 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:01:52,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2022-03-20 04:01:52,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693712227] [2022-03-20 04:01:52,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:01:52,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:01:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:01:52,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:01:52,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=231, Unknown=1, NotChecked=32, Total=342 [2022-03-20 04:01:52,662 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 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:01:53,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:01:53,019 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2022-03-20 04:01:53,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:01:53,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 04:01:53,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:01:53,021 INFO L225 Difference]: With dead ends: 36 [2022-03-20 04:01:53,021 INFO L226 Difference]: Without dead ends: 33 [2022-03-20 04:01:53,021 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=137, Invalid=418, Unknown=1, NotChecked=44, Total=600 [2022-03-20 04:01:53,031 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:01:53,032 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 49 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 73 Invalid, 0 Unknown, 29 Unchecked, 0.1s Time] [2022-03-20 04:01:53,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-03-20 04:01:53,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-03-20 04:01:53,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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:01:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-03-20 04:01:53,041 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2022-03-20 04:01:53,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:01:53,041 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-03-20 04:01:53,041 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 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:01:53,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-03-20 04:01:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:01:53,044 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:01:53,046 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:01:53,067 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:01:53,267 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:01:53,268 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:01:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:01:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash 2088406878, now seen corresponding path program 1 times [2022-03-20 04:01:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:01:53,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676320136] [2022-03-20 04:01:53,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:53,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:01:53,272 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:01:53,273 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:01:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:53,292 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:01:53,298 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:01:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:01:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:53,414 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:01:53,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:01:53,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676320136] [2022-03-20 04:01:53,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676320136] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:01:53,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607521569] [2022-03-20 04:01:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:01:53,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:01:53,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:01:53,420 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:01:53,443 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:01:53,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:01:53,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 11 conjunts are in the unsatisfiable core [2022-03-20 04:01:53,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:01:54,214 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:01:54,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:02:05,414 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:02:05,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607521569] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:02:05,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:02:05,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 19 [2022-03-20 04:02:05,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490057688] [2022-03-20 04:02:05,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:02:05,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:02:05,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:02:05,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:02:05,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=262, Unknown=2, NotChecked=0, Total=342 [2022-03-20 04:02:05,416 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 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:02:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:02:06,095 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-03-20 04:02:06,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 04:02:06,095 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 04:02:06,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:02:06,097 INFO L225 Difference]: With dead ends: 41 [2022-03-20 04:02:06,097 INFO L226 Difference]: Without dead ends: 37 [2022-03-20 04:02:06,098 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=194, Invalid=674, Unknown=2, NotChecked=0, Total=870 [2022-03-20 04:02:06,099 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 35 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:02:06,100 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 60 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 64 Invalid, 0 Unknown, 55 Unchecked, 0.1s Time] [2022-03-20 04:02:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-20 04:02:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2022-03-20 04:02:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5) internal successors, (36), 24 states have internal predecessors, (36), 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:02:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2022-03-20 04:02:06,102 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2022-03-20 04:02:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:02:06,102 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2022-03-20 04:02:06,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 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:02:06,104 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2022-03-20 04:02:06,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:02:06,105 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:02:06,105 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:02:06,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-03-20 04:02:06,305 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:02:06,306 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:02:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:02:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1433573341, now seen corresponding path program 1 times [2022-03-20 04:02:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:02:06,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447454935] [2022-03-20 04:02:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:02:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:02:06,314 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:02:06,316 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:02:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:06,335 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:02:06,358 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:02:06,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:02:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:06,521 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:02:06,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:02:06,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447454935] [2022-03-20 04:02:06,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447454935] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:02:06,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104879204] [2022-03-20 04:02:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:02:06,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:02:06,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:02:06,527 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:02:06,528 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:02:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:06,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:02:06,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:02:06,978 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:02:06,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:02:07,422 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:02:07,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104879204] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:02:07,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:02:07,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2022-03-20 04:02:07,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792947996] [2022-03-20 04:02:07,423 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:02:07,423 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:02:07,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:02:07,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:02:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-03-20 04:02:07,424 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:02:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:02:09,968 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-03-20 04:02:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 04:02:09,969 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 04:02:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:02:09,969 INFO L225 Difference]: With dead ends: 39 [2022-03-20 04:02:09,969 INFO L226 Difference]: Without dead ends: 36 [2022-03-20 04:02:09,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=171, Invalid=584, Unknown=1, NotChecked=0, Total=756 [2022-03-20 04:02:09,970 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:02:09,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 91 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-03-20 04:02:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-03-20 04:02:09,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-03-20 04:02:09,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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:02:09,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2022-03-20 04:02:09,973 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 17 [2022-03-20 04:02:09,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:02:09,973 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2022-03-20 04:02:09,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 16 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:02:09,973 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2022-03-20 04:02:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:02:09,973 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:02:09,973 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:02:09,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-20 04:02:10,187 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:02:10,187 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:02:10,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:02:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1054189566, now seen corresponding path program 1 times [2022-03-20 04:02:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:02:10,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053370038] [2022-03-20 04:02:10,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:02:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:02:10,191 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:02:10,192 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:02:10,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:10,212 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.3))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:02:10,219 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-03-20 04:02:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:02:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:10,382 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:02:10,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:02:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053370038] [2022-03-20 04:02:10,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053370038] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:02:10,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519602480] [2022-03-20 04:02:10,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:02:10,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:02:10,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:02:10,384 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:02:10,384 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:02:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:10,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:02:10,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:02:10,661 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:02:10,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:02:13,848 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:02:13,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519602480] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:02:13,849 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:02:13,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-03-20 04:02:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179840604] [2022-03-20 04:02:13,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:02:13,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 04:02:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:02:13,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 04:02:13,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=194, Unknown=1, NotChecked=0, Total=240 [2022-03-20 04:02:13,850 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 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:02:18,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:02:18,996 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-03-20 04:02:18,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 04:02:18,997 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-03-20 04:02:18,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:02:18,997 INFO L225 Difference]: With dead ends: 40 [2022-03-20 04:02:18,997 INFO L226 Difference]: Without dead ends: 37 [2022-03-20 04:02:18,998 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=119, Invalid=430, Unknown=3, NotChecked=0, Total=552 [2022-03-20 04:02:18,998 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:02:18,999 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 69 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-03-20 04:02:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-03-20 04:02:19,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-03-20 04:02:19,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 28 states have internal predecessors, (43), 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:02:19,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-03-20 04:02:19,010 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 17 [2022-03-20 04:02:19,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:02:19,011 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2022-03-20 04:02:19,011 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 13 states have internal predecessors, (30), 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:02:19,011 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2022-03-20 04:02:19,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:02:19,011 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:02:19,011 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:02:19,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-20 04:02:19,212 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:02:19,214 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:02:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:02:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 325265765, now seen corresponding path program 2 times [2022-03-20 04:02:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:02:19,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048890858] [2022-03-20 04:02:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:02:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:02:19,218 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:02:19,224 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:02:19,225 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-03-20 04:02:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:19,239 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.5))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:02:19,246 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-20 04:02:19,249 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.7))) (+ .cse0 main_~x~0_11 (* (- 4294967296) (div (+ .cse0 main_~x~0_11) 4294967296)))) 0)) [2022-03-20 04:02:19,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:02:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:02:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:02:19,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:02:19,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048890858] [2022-03-20 04:02:19,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048890858] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:02:19,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987915716] [2022-03-20 04:02:19,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:02:19,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:02:19,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:02:19,393 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:02:19,394 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:02:19,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:02:19,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:02:19,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 04:02:19,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:02:19,544 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:02:19,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:02:26,436 WARN L232 SmtUtils]: Spent 5.01s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:02:29,475 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((v_main_~y~0_34 Int)) (or (let ((.cse1 (< 0 (mod (+ (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296)))) (and (or .cse1 (let ((.cse3 (* (div c_main_~n~0 4294967296) 4294967296)) (.cse2 (+ (* (div v_main_~y~0_34 4294967296) 4294967296) c_main_~n~0))) (and (< .cse2 (+ .cse3 v_main_~y~0_34 1)) (<= (+ .cse3 v_main_~y~0_34) .cse2)))) (or (and (forall ((aux_div_v_main_~y~0_33_31 Int) (aux_mod_v_main_~y~0_33_31 Int)) (or (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_34 v_it_4 1) (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296))) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296))))) (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~y~0_33_31) c_main_~n~0) (not (< v_main_~y~0_34 (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296)))) (>= aux_mod_v_main_~y~0_33_31 4294967296))) (forall ((aux_div_v_main_~y~0_33_31 Int) (aux_mod_v_main_~y~0_33_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~y~0_33_31 1)) (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_34 v_it_4 1) (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296))) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296))))) (not (< v_main_~y~0_34 (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296)))) (> 0 aux_mod_v_main_~y~0_33_31)))) (not .cse1)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_34))) (not (< c_main_~y~0 v_main_~y~0_34))))) (or (let ((.cse5 (+ (* 4294967296 (div c_main_~y~0 4294967296)) c_main_~n~0)) (.cse4 (* (div c_main_~n~0 4294967296) 4294967296))) (and (<= (+ .cse4 c_main_~y~0) .cse5) (< .cse5 (+ .cse4 c_main_~y~0 1)))) .cse0))) is different from false [2022-03-20 04:02:32,712 WARN L855 $PredicateComparison]: unable to prove that (or (< 0 (mod c_main_~y~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (not .cse0) (forall ((v_main_~y~0_34 Int)) (or (let ((.cse1 (< 0 (mod (+ (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296)))) (and (or .cse1 (let ((.cse3 (* (div c_main_~n~0 4294967296) 4294967296)) (.cse2 (+ (* (div v_main_~y~0_34 4294967296) 4294967296) c_main_~n~0))) (and (< .cse2 (+ .cse3 v_main_~y~0_34 1)) (<= (+ .cse3 v_main_~y~0_34) .cse2)))) (or (and (forall ((aux_div_v_main_~y~0_33_31 Int) (aux_mod_v_main_~y~0_33_31 Int)) (or (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_34 v_it_4 1) (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296))) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296))))) (<= (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~y~0_33_31) c_main_~n~0) (not (< v_main_~y~0_34 (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296)))) (>= aux_mod_v_main_~y~0_33_31 4294967296))) (forall ((aux_div_v_main_~y~0_33_31 Int) (aux_mod_v_main_~y~0_33_31 Int)) (or (< c_main_~n~0 (+ (* (div c_main_~n~0 4294967296) 4294967296) aux_mod_v_main_~y~0_33_31 1)) (exists ((v_it_4 Int)) (and (<= (+ v_main_~y~0_34 v_it_4 1) (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296))) (<= 1 v_it_4) (not (< 0 (mod (+ (* v_it_4 4294967295) (* v_main_~y~0_34 4294967295) c_main_~x~0 c_main_~y~0) 4294967296))))) (not (< v_main_~y~0_34 (+ aux_mod_v_main_~y~0_33_31 (* aux_div_v_main_~y~0_33_31 4294967296)))) (> 0 aux_mod_v_main_~y~0_33_31)))) (not .cse1)))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= 1 v_it_4) (<= (+ v_it_4 c_main_~y~0 1) v_main_~y~0_34))) (not (< c_main_~y~0 v_main_~y~0_34))))) (or (< (+ (* 4294967296 (div c_main_~y~0 4294967296)) c_main_~n~0) (+ (* (div c_main_~n~0 4294967296) 4294967296) c_main_~y~0 1)) .cse0)))) is different from true [2022-03-20 04:04:28,136 WARN L232 SmtUtils]: Spent 14.70s on a formula simplification that was a NOOP. DAG size: 136 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:05:00,493 WARN L232 SmtUtils]: Spent 20.89s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-20 04:05:05,834 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:05:05,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987915716] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:05:05,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:05:05,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 11] total 20 [2022-03-20 04:05:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474218189] [2022-03-20 04:05:05,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:05:05,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 04:05:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:05:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 04:05:05,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=231, Unknown=10, NotChecked=66, Total=380 [2022-03-20 04:05:05,836 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 20 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:05:19,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:05:19,114 INFO L93 Difference]: Finished difference Result 45 states and 64 transitions. [2022-03-20 04:05:19,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:05:19,115 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-03-20 04:05:19,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:05:19,115 INFO L225 Difference]: With dead ends: 45 [2022-03-20 04:05:19,115 INFO L226 Difference]: Without dead ends: 39 [2022-03-20 04:05:19,116 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 77.9s TimeCoverageRelationStatistics Valid=121, Invalid=379, Unknown=14, NotChecked=86, Total=600 [2022-03-20 04:05:19,116 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:05:19,116 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 56 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 77 Invalid, 0 Unknown, 52 Unchecked, 0.1s Time] [2022-03-20 04:05:19,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-03-20 04:05:19,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-03-20 04:05:19,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 30 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:19,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2022-03-20 04:05:19,118 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 18 [2022-03-20 04:05:19,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:05:19,118 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2022-03-20 04:05:19,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.45) internal successors, (29), 17 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:05:19,119 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2022-03-20 04:05:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-03-20 04:05:19,119 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:05:19,119 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:19,137 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:05:19,319 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:05:19,322 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:05:19,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:05:19,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1481938624, now seen corresponding path program 1 times [2022-03-20 04:05:19,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:05:19,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132358939] [2022-03-20 04:05:19,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:19,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:05:19,326 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:19,326 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:19,327 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.2))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-20 04:05:19,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:19,341 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:19,345 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:05:19,349 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.6))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-03-20 04:05:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:05:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:05:19,512 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:05:19,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:05:19,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132358939] [2022-03-20 04:05:19,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132358939] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:05:19,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555018492] [2022-03-20 04:05:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:05:19,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:05:19,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:05:19,514 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:05:19,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process