/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-de42.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 04:02:56,725 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 04:02:56,727 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 04:02:56,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 04:02:56,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 04:02:56,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 04:02:56,807 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 04:02:56,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 04:02:56,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 04:02:56,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 04:02:56,814 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 04:02:56,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 04:02:56,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 04:02:56,817 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 04:02:56,818 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 04:02:56,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 04:02:56,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 04:02:56,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 04:02:56,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 04:02:56,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 04:02:56,828 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 04:02:56,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 04:02:56,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 04:02:56,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 04:02:56,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 04:02:56,836 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 04:02:56,836 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 04:02:56,837 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 04:02:56,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 04:02:56,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 04:02:56,839 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 04:02:56,839 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 04:02:56,840 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 04:02:56,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 04:02:56,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 04:02:56,841 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 04:02:56,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 04:02:56,842 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 04:02:56,842 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 04:02:56,842 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 04:02:56,843 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 04:02:56,844 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 04:02:56,845 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-03-20 04:02:56,853 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 04:02:56,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 04:02:56,855 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 04:02:56,855 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 04:02:56,856 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 04:02:56,856 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 04:02:56,856 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 04:02:56,856 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 04:02:56,856 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 04:02:56,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 04:02:56,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 04:02:56,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:02:56,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 04:02:56,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 04:02:56,858 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-03-20 04:02:56,859 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:02:57,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 04:02:57,075 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 04:02:57,078 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 04:02:57,079 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 04:02:57,095 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 04:02:57,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-03-20 04:02:57,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33172c0d8/61d77dde59944a87b92ee35606c56e35/FLAG8af4b1ba7 [2022-03-20 04:02:57,469 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 04:02:57,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de42.c [2022-03-20 04:02:57,475 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33172c0d8/61d77dde59944a87b92ee35606c56e35/FLAG8af4b1ba7 [2022-03-20 04:02:57,905 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33172c0d8/61d77dde59944a87b92ee35606c56e35 [2022-03-20 04:02:57,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 04:02:57,908 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-20 04:02:57,911 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 04:02:57,911 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 04:02:57,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 04:02:57,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:02:57" (1/1) ... [2022-03-20 04:02:57,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c6c70a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:57, skipping insertion in model container [2022-03-20 04:02:57,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 04:02:57" (1/1) ... [2022-03-20 04:02:57,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 04:02:57,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 04:02:58,050 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-de42.c[368,381] [2022-03-20 04:02:58,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:02:58,066 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 04:02:58,074 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-de42.c[368,381] [2022-03-20 04:02:58,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 04:02:58,085 INFO L208 MainTranslator]: Completed translation [2022-03-20 04:02:58,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58 WrapperNode [2022-03-20 04:02:58,086 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 04:02:58,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 04:02:58,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 04:02:58,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 04:02:58,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 04:02:58,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 04:02:58,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 04:02:58,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 04:02:58,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 04:02:58,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:02:58,129 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:02:58,146 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:02:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 04:02:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 04:02:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 04:02:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 04:02:58,158 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 04:02:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 04:02:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 04:02:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 04:02:58,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 04:02:58,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 04:02:58,202 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 04:02:58,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 04:02:58,291 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 04:02:58,295 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 04:02:58,296 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-03-20 04:02:58,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:02:58 BoogieIcfgContainer [2022-03-20 04:02:58,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 04:02:58,298 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-03-20 04:02:58,298 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-03-20 04:02:58,299 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-03-20 04:02:58,301 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:02:58" (1/1) ... [2022-03-20 04:02:58,302 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-03-20 04:02:58,518 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:02:58,519 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:02:58,661 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:02:58,661 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_10 (+ v_main_~z~0_9 1)) (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_10 4294967296))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_9, 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_10 4294967296))) (or (and (= v_main_~x~0_9 v_main_~x~0_8) (<= .cse0 0) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (= v_main_~z~0_10 v_main_~z~0_9) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)) (and (= v_main_~z~0_9 (+ (* (- 1) v_main_~x~0_8) v_main_~z~0_10 v_main_~x~0_9)) (< v_main_~x~0_9 v_main_~x~0_8) (< 0 .cse0) (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_10 (* v_it_2 4294967295)) 4294967296))))))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_10, 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_9, 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:03:00,734 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:03:00,734 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:03:00,792 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:03:00,792 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_4 (+ v_main_~z~0_5 1)) (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296))) InVars {main_~x~0=v_main_~x~0_7, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_~z~0=v_main_~z~0_4, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (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_~z~0_5 v_main_~z~0_4) (= v_main_~x~0_7 v_main_~x~0_6)) (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) (= v_main_~z~0_4 (+ (* (- 1) v_main_~x~0_6) v_main_~x~0_7 v_main_~z~0_5))))) InVars {main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|, main_~z~0=v_main_~z~0_5} OutVars{main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post11, main_#t~post12] [2022-03-20 04:03:00,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:03:00 BasicIcfg [2022-03-20 04:03:00,796 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-03-20 04:03:00,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 04:03:00,797 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 04:03:00,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 04:03:00,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 04:02:57" (1/4) ... [2022-03-20 04:03:00,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1e1fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:03:00, skipping insertion in model container [2022-03-20 04:03:00,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 04:02:58" (2/4) ... [2022-03-20 04:03:00,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1e1fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 04:03:00, skipping insertion in model container [2022-03-20 04:03:00,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 04:02:58" (3/4) ... [2022-03-20 04:03:00,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e1e1fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 04:03:00, skipping insertion in model container [2022-03-20 04:03:00,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 20.03 04:03:00" (4/4) ... [2022-03-20 04:03:00,801 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de42.cJordan [2022-03-20 04:03:00,812 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-03-20 04:03:00,812 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 04:03:00,859 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 04:03:00,864 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:03:00,865 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 04:03:00,890 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:03:00,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-20 04:03:00,896 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:00,896 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:00,896 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:00,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:00,900 INFO L85 PathProgramCache]: Analyzing trace with hash -2015447748, now seen corresponding path program 1 times [2022-03-20 04:03:00,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:00,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47619530] [2022-03-20 04:03:00,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:00,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:00,994 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:03:00,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:00,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47619530] [2022-03-20 04:03:00,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47619530] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:00,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:03:00,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 04:03:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989593939] [2022-03-20 04:03:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:01,003 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 04:03:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:01,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 04:03:01,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 04:03:01,033 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:03:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:01,064 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-03-20 04:03:01,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 04:03:01,069 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:03:01,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:01,074 INFO L225 Difference]: With dead ends: 23 [2022-03-20 04:03:01,074 INFO L226 Difference]: Without dead ends: 16 [2022-03-20 04:03:01,075 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:03:01,078 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:03:01,078 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:03:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-03-20 04:03:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-03-20 04:03:01,099 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:03:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-03-20 04:03:01,101 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 15 [2022-03-20 04:03:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:01,101 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-03-20 04:03:01,102 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:03:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-03-20 04:03:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-03-20 04:03:01,102 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:01,102 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:01,103 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 04:03:01,103 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:01,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1389121438, now seen corresponding path program 1 times [2022-03-20 04:03:01,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:01,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945049335] [2022-03-20 04:03:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:01,473 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:03:01,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:01,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945049335] [2022-03-20 04:03:01,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945049335] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:01,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 04:03:01,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 04:03:01,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799469665] [2022-03-20 04:03:01,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:01,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 04:03:01,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:01,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 04:03:01,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-20 04:03:01,477 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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:03:01,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:01,666 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-03-20 04:03:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 04:03:01,666 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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:03:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:01,667 INFO L225 Difference]: With dead ends: 27 [2022-03-20 04:03:01,667 INFO L226 Difference]: Without dead ends: 24 [2022-03-20 04:03:01,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:03:01,668 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:01,669 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 51 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 70 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-03-20 04:03:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-03-20 04:03:01,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-03-20 04:03:01,671 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:03:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-03-20 04:03:01,672 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 15 [2022-03-20 04:03:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:01,672 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-03-20 04:03:01,672 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 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:03:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2022-03-20 04:03:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:03:01,673 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:01,673 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:03:01,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 04:03:01,673 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 139812261, now seen corresponding path program 1 times [2022-03-20 04:03:01,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:01,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952153298] [2022-03-20 04:03:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:01,688 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:03:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:01,729 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:03:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:01,874 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:03:01,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:01,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952153298] [2022-03-20 04:03:01,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952153298] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:01,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88185019] [2022-03-20 04:03:01,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:01,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:01,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:01,884 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:03:01,887 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:03:01,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:01,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:03:01,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:02,152 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:03:02,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:03:02,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88185019] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:02,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:03:02,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-03-20 04:03:02,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070556260] [2022-03-20 04:03:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:02,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 04:03:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:02,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 04:03:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:03:02,154 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:03:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:02,183 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2022-03-20 04:03:02,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-03-20 04:03:02,183 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:03:02,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:02,184 INFO L225 Difference]: With dead ends: 25 [2022-03-20 04:03:02,184 INFO L226 Difference]: Without dead ends: 20 [2022-03-20 04:03:02,184 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-20 04:03:02,185 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:02,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-03-20 04:03:02,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-03-20 04:03:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-03-20 04:03:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 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:03:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 25 transitions. [2022-03-20 04:03:02,188 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 25 transitions. Word has length 16 [2022-03-20 04:03:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:02,188 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-03-20 04:03:02,188 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:03:02,188 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 25 transitions. [2022-03-20 04:03:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:03:02,189 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:02,189 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:03:02,210 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:03:02,406 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:03:02,407 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:02,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash 912799338, now seen corresponding path program 1 times [2022-03-20 04:03:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046375045] [2022-03-20 04:03:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:02,413 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:02,438 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:03:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:02,587 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:03:02,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:02,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046375045] [2022-03-20 04:03:02,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046375045] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:02,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748438947] [2022-03-20 04:03:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:02,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:02,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:02,589 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:03:02,590 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:03:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:02,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:03:02,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:02,765 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:03:02,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:03:14,627 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:03:14,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748438947] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:03:14,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:03:14,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 20 [2022-03-20 04:03:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776989192] [2022-03-20 04:03:14,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:03:14,629 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 04:03:14,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 04:03:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=295, Unknown=7, NotChecked=0, Total=380 [2022-03-20 04:03:14,630 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:03:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:14,955 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-03-20 04:03:14,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:03:14,956 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-03-20 04:03:14,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:14,956 INFO L225 Difference]: With dead ends: 28 [2022-03-20 04:03:14,957 INFO L226 Difference]: Without dead ends: 25 [2022-03-20 04:03:14,957 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=145, Invalid=550, Unknown=7, NotChecked=0, Total=702 [2022-03-20 04:03:14,958 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:14,958 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 21 Unchecked, 0.1s Time] [2022-03-20 04:03:14,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-20 04:03:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2022-03-20 04:03:14,960 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:03:14,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-03-20 04:03:14,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 16 [2022-03-20 04:03:14,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:14,961 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-03-20 04:03:14,961 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 17 states have internal predecessors, (28), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:03:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-03-20 04:03:14,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:03:14,961 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:14,961 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:03:14,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-20 04:03:15,162 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:03:15,162 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:15,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:15,163 INFO L85 PathProgramCache]: Analyzing trace with hash -894405051, now seen corresponding path program 1 times [2022-03-20 04:03:15,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:15,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524203259] [2022-03-20 04:03:15,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:15,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:15,168 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:03:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:15,199 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:03:15,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:15,361 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:03:15,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:15,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524203259] [2022-03-20 04:03:15,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524203259] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:15,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513257846] [2022-03-20 04:03:15,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:15,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:15,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:15,363 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:03:15,365 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:03:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:15,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2022-03-20 04:03:15,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:15,516 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:03:15,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 04:03:15,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513257846] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 04:03:15,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-20 04:03:15,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-03-20 04:03:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569082850] [2022-03-20 04:03:15,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 04:03:15,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 04:03:15,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:15,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 04:03:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-03-20 04:03:15,518 INFO L87 Difference]: Start difference. First operand 22 states and 28 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:03:15,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:15,559 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-03-20 04:03:15,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:03:15,560 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:03:15,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:15,561 INFO L225 Difference]: With dead ends: 28 [2022-03-20 04:03:15,561 INFO L226 Difference]: Without dead ends: 25 [2022-03-20 04:03:15,562 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-03-20 04:03:15,562 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:15,562 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-03-20 04:03:15,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-03-20 04:03:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-03-20 04:03:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 18 states have internal predecessors, (26), 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:03:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2022-03-20 04:03:15,565 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 16 [2022-03-20 04:03:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:15,565 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2022-03-20 04:03:15,565 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:03:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2022-03-20 04:03:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-03-20 04:03:15,566 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:15,566 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:03:15,597 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:03:15,782 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:03:15,783 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:15,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:15,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1590526661, now seen corresponding path program 1 times [2022-03-20 04:03:15,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:15,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272065613] [2022-03-20 04:03:15,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:15,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:15,802 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:03:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:15,832 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:03:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:15,984 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:03:15,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272065613] [2022-03-20 04:03:15,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272065613] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:15,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333765508] [2022-03-20 04:03:15,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:15,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:15,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:15,996 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:03:16,032 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:03:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:16,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-20 04:03:16,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:16,667 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:03:16,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:03:21,043 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:03:21,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333765508] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:03:21,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:03:21,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 19 [2022-03-20 04:03:21,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050034199] [2022-03-20 04:03:21,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:03:21,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:03:21,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:03:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=264, Unknown=2, NotChecked=0, Total=342 [2022-03-20 04:03:21,047 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 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:03:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:21,213 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-03-20 04:03:21,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:03:21,214 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 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:03:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:21,214 INFO L225 Difference]: With dead ends: 34 [2022-03-20 04:03:21,214 INFO L226 Difference]: Without dead ends: 31 [2022-03-20 04:03:21,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=132, Invalid=466, Unknown=2, NotChecked=0, Total=600 [2022-03-20 04:03:21,215 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 33 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:21,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 66 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 75 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-03-20 04:03:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-20 04:03:21,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-03-20 04:03:21,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:03:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-03-20 04:03:21,218 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 16 [2022-03-20 04:03:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:21,218 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-03-20 04:03:21,218 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.368421052631579) internal successors, (26), 16 states have internal predecessors, (26), 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:03:21,218 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-03-20 04:03:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:03:21,218 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:21,218 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:03:21,234 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:03:21,424 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:03:21,425 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:21,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:21,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1741270951, now seen corresponding path program 1 times [2022-03-20 04:03:21,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:21,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479679066] [2022-03-20 04:03:21,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:21,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:21,435 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:21,436 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:03:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:21,452 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:21,463 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-03-20 04:03:21,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:21,607 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:03:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:21,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479679066] [2022-03-20 04:03:21,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479679066] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:21,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340595958] [2022-03-20 04:03:21,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:21,610 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:03:21,612 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:03:21,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:21,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 14 conjunts are in the unsatisfiable core [2022-03-20 04:03:21,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:21,860 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:03:21,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:03:29,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_21_31 Int) (v_main_~z~0_22 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_21_31) (< aux_mod_v_main_~z~0_21_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (not (= v_main_~z~0_22 c_main_~z~0))) (or (not (< c_main_~z~0 v_main_~z~0_22)) (not .cse0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~z~0 1) v_main_~z~0_22)))))) (= aux_mod_v_main_~z~0_21_31 (mod (* 2 c_main_~n~0) 4294967296)) (let ((.cse4 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_16_31 Int) (aux_div_v_main_~z~0_21_31 Int)) (let ((.cse3 (* 4294967296 aux_div_v_main_~z~0_21_31))) (let ((.cse2 (+ v_main_~z~0_22 c_main_~x~0)) (.cse1 (+ aux_mod_v_main_~z~0_21_31 (* aux_div_v_main_~x~0_16_31 4294967296) .cse3))) (or (< .cse1 .cse2) (< .cse2 .cse1) (not (< v_main_~z~0_22 (+ aux_mod_v_main_~z~0_21_31 .cse3))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~z~0_22 v_it_4 1) (+ aux_mod_v_main_~z~0_21_31 (* 4294967296 aux_div_v_main_~z~0_21_31))) (<= 1 v_it_4))))))) (not .cse4)) (or .cse4 (forall ((aux_div_v_main_~z~0_21_31 Int)) (not (= v_main_~z~0_22 (+ aux_mod_v_main_~z~0_21_31 (* 4294967296 aux_div_v_main_~z~0_21_31)))))))))) is different from false [2022-03-20 04:03:32,829 WARN L855 $PredicateComparison]: unable to prove that (or (< 0 (mod c_main_~z~0 4294967296)) (forall ((aux_mod_v_main_~z~0_21_31 Int) (v_main_~z~0_22 Int)) (or (<= 4294967296 aux_mod_v_main_~z~0_21_31) (< aux_mod_v_main_~z~0_21_31 0) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (not (= v_main_~z~0_22 c_main_~z~0))) (or (not (< c_main_~z~0 v_main_~z~0_22)) (not .cse0) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= 1 v_it_3) (<= (+ v_it_3 c_main_~z~0 1) v_main_~z~0_22)))))) (= aux_mod_v_main_~z~0_21_31 (mod (* 2 c_main_~n~0) 4294967296)) (let ((.cse4 (< 0 (mod c_main_~x~0 4294967296)))) (and (or (forall ((aux_div_v_main_~x~0_16_31 Int) (aux_div_v_main_~z~0_21_31 Int)) (let ((.cse3 (* 4294967296 aux_div_v_main_~z~0_21_31))) (let ((.cse2 (+ v_main_~z~0_22 c_main_~x~0)) (.cse1 (+ aux_mod_v_main_~z~0_21_31 (* aux_div_v_main_~x~0_16_31 4294967296) .cse3))) (or (< .cse1 .cse2) (< .cse2 .cse1) (not (< v_main_~z~0_22 (+ aux_mod_v_main_~z~0_21_31 .cse3))) (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_main_~z~0_22 v_it_4 1) (+ aux_mod_v_main_~z~0_21_31 (* 4294967296 aux_div_v_main_~z~0_21_31))) (<= 1 v_it_4))))))) (not .cse4)) (or .cse4 (forall ((aux_div_v_main_~z~0_21_31 Int)) (not (= v_main_~z~0_22 (+ aux_mod_v_main_~z~0_21_31 (* 4294967296 aux_div_v_main_~z~0_21_31))))))))))) is different from true [2022-03-20 04:03:35,493 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:03:35,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340595958] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:03:35,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:03:35,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 20 [2022-03-20 04:03:35,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750549873] [2022-03-20 04:03:35,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:03:35,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 04:03:35,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:35,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 04:03:35,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=241, Unknown=4, NotChecked=66, Total=380 [2022-03-20 04:03:35,495 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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:03:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:38,609 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-03-20 04:03:38,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 04:03:38,609 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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:03:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:38,610 INFO L225 Difference]: With dead ends: 35 [2022-03-20 04:03:38,610 INFO L226 Difference]: Without dead ends: 30 [2022-03-20 04:03:38,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=123, Invalid=433, Unknown=4, NotChecked=90, Total=650 [2022-03-20 04:03:38,612 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:38,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 78 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 95 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2022-03-20 04:03:38,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-03-20 04:03:38,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2022-03-20 04:03:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 22 states have internal predecessors, (32), 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:03:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-03-20 04:03:38,621 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2022-03-20 04:03:38,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:38,621 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-03-20 04:03:38,621 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 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:03:38,621 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-03-20 04:03:38,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:03:38,621 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:38,622 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 04:03:38,653 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:03:38,854 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:03:38,855 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -968283874, now seen corresponding path program 2 times [2022-03-20 04:03:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:38,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258904552] [2022-03-20 04:03:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:38,860 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:38,862 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:38,891 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:38,893 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-03-20 04:03:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:39,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:03:39,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:39,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258904552] [2022-03-20 04:03:39,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258904552] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:39,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469210286] [2022-03-20 04:03:39,074 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 04:03:39,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:39,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:39,075 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:03:39,076 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:03:39,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 04:03:39,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 04:03:39,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 04:03:39,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-20 04:03:39,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:03:49,207 WARN L833 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_27_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (forall ((v_main_~z~0_28 Int)) (or (not (< c_main_~z~0 v_main_~z~0_28)) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) v_main_~z~0_28) (<= 1 v_it_3))) (let ((.cse1 (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* v_main_~z~0_28 4294967295)) 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_27_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0 c_main_~z~0 (* v_main_~z~0_28 4294967295)) 4294967296))) (<= 1 v_it_3) (<= (+ v_main_~z~0_28 v_it_3 1) (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31))))) (not (< v_main_~z~0_28 (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31)))))) (not .cse1)) (or (forall ((aux_div_v_main_~z~0_27_31 Int)) (not (= v_main_~z~0_28 (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31))))) .cse1)))))) (or .cse0 (forall ((aux_div_v_main_~z~0_27_31 Int)) (not (= (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31)) c_main_~z~0)))))) (>= aux_mod_v_main_~z~0_27_31 4294967296) (= aux_mod_v_main_~z~0_27_31 (mod (* 2 c_main_~n~0) 4294967296)) (> 0 aux_mod_v_main_~z~0_27_31))) is different from false [2022-03-20 04:03:52,326 WARN L855 $PredicateComparison]: unable to prove that (or (< 0 (mod c_main_~z~0 4294967296)) (forall ((aux_mod_v_main_~z~0_27_31 Int)) (or (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or (not .cse0) (forall ((v_main_~z~0_28 Int)) (or (not (< c_main_~z~0 v_main_~z~0_28)) (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_3 c_main_~z~0 1) v_main_~z~0_28) (<= 1 v_it_3))) (let ((.cse1 (< 0 (mod (+ c_main_~y~0 c_main_~z~0 (* v_main_~z~0_28 4294967295)) 4294967296)))) (and (or (forall ((aux_div_v_main_~z~0_27_31 Int)) (or (exists ((v_it_3 Int)) (and (not (< 0 (mod (+ (* v_it_3 4294967295) c_main_~y~0 c_main_~z~0 (* v_main_~z~0_28 4294967295)) 4294967296))) (<= 1 v_it_3) (<= (+ v_main_~z~0_28 v_it_3 1) (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31))))) (not (< v_main_~z~0_28 (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31)))))) (not .cse1)) (or (forall ((aux_div_v_main_~z~0_27_31 Int)) (not (= v_main_~z~0_28 (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31))))) .cse1)))))) (or .cse0 (forall ((aux_div_v_main_~z~0_27_31 Int)) (not (= (+ aux_mod_v_main_~z~0_27_31 (* 4294967296 aux_div_v_main_~z~0_27_31)) c_main_~z~0)))))) (>= aux_mod_v_main_~z~0_27_31 4294967296) (= aux_mod_v_main_~z~0_27_31 (mod (* 2 c_main_~n~0) 4294967296)) (> 0 aux_mod_v_main_~z~0_27_31)))) is different from true [2022-03-20 04:03:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-03-20 04:03:52,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469210286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:03:52,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:03:52,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 21 [2022-03-20 04:03:52,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657435018] [2022-03-20 04:03:52,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:03:52,914 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-20 04:03:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:03:52,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-20 04:03:52,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=269, Unknown=6, NotChecked=70, Total=420 [2022-03-20 04:03:52,915 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 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:03:53,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:03:53,062 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-03-20 04:03:53,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 04:03:53,062 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 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:03:53,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:03:53,063 INFO L225 Difference]: With dead ends: 34 [2022-03-20 04:03:53,063 INFO L226 Difference]: Without dead ends: 31 [2022-03-20 04:03:53,063 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=119, Invalid=435, Unknown=6, NotChecked=90, Total=650 [2022-03-20 04:03:53,064 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:03:53,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 57 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 69 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2022-03-20 04:03:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-03-20 04:03:53,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-03-20 04:03:53,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 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:03:53,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2022-03-20 04:03:53,066 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 17 [2022-03-20 04:03:53,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:03:53,066 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2022-03-20 04:03:53,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.55) internal successors, (31), 18 states have internal predecessors, (31), 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:03:53,066 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2022-03-20 04:03:53,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:03:53,067 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:03:53,067 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:03:53,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-20 04:03:53,283 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:03:53,284 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:03:53,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:03:53,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1930032162, now seen corresponding path program 1 times [2022-03-20 04:03:53,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:03:53,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090458269] [2022-03-20 04:03:53,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:53,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:03:53,289 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:03:53,290 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:03:53,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:53,310 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:03:53,323 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:03:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:03:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:53,451 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:03:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:03:53,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090458269] [2022-03-20 04:03:53,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090458269] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:03:53,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578803237] [2022-03-20 04:03:53,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:03:53,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:03:53,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:03:53,453 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:03:53,453 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:03:53,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:03:53,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 15 conjunts are in the unsatisfiable core [2022-03-20 04:03:53,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 04:03:53,650 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:03:53,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 04:04:27,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 04:04:27,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578803237] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 04:04:27,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-20 04:04:27,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 19 [2022-03-20 04:04:27,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947042489] [2022-03-20 04:04:27,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-20 04:04:27,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 04:04:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 04:04:27,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 04:04:27,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=264, Unknown=11, NotChecked=0, Total=342 [2022-03-20 04:04:27,630 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 16 states have internal predecessors, (30), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:04:32,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 04:04:32,336 INFO L93 Difference]: Finished difference Result 37 states and 51 transitions. [2022-03-20 04:04:32,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 04:04:32,337 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), 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:04:32,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 04:04:32,337 INFO L225 Difference]: With dead ends: 37 [2022-03-20 04:04:32,337 INFO L226 Difference]: Without dead ends: 34 [2022-03-20 04:04:32,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 36.5s TimeCoverageRelationStatistics Valid=118, Invalid=469, Unknown=13, NotChecked=0, Total=600 [2022-03-20 04:04:32,338 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 04:04:32,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 55 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 58 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2022-03-20 04:04:32,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-03-20 04:04:32,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-03-20 04:04:32,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.48) internal successors, (37), 25 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-03-20 04:04:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2022-03-20 04:04:32,341 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 17 [2022-03-20 04:04:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 04:04:32,341 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-03-20 04:04:32,341 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), 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:04:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2022-03-20 04:04:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-03-20 04:04:32,342 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 04:04:32,342 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:04:32,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-20 04:04:32,542 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:04:32,543 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 04:04:32,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 04:04:32,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1157045085, now seen corresponding path program 1 times [2022-03-20 04:04:32,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 04:04:32,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390621631] [2022-03-20 04:04:32,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:04:32,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 04:04:32,547 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:04:32,547 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:04:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:32,558 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:04:32,560 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-03-20 04:04:32,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 04:04:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 04:04:32,679 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:04:32,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 04:04:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390621631] [2022-03-20 04:04:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390621631] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 04:04:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334636721] [2022-03-20 04:04:32,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 04:04:32,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 04:04:32,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 04:04:32,685 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:04:32,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process