/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 12:53:10,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 12:53:10,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 12:53:10,493 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 12:53:10,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 12:53:10,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 12:53:10,495 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 12:53:10,496 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 12:53:10,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 12:53:10,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 12:53:10,498 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 12:53:10,499 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 12:53:10,499 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 12:53:10,500 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 12:53:10,500 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 12:53:10,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 12:53:10,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 12:53:10,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 12:53:10,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 12:53:10,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 12:53:10,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 12:53:10,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 12:53:10,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 12:53:10,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 12:53:10,508 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 12:53:10,508 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 12:53:10,509 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 12:53:10,509 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 12:53:10,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 12:53:10,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 12:53:10,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 12:53:10,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 12:53:10,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 12:53:10,511 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 12:53:10,512 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 12:53:10,512 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 12:53:10,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 12:53:10,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 12:53:10,513 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 12:53:10,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 12:53:10,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 12:53:10,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-01-31 12:53:10,537 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 12:53:10,538 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 12:53:10,538 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 12:53:10,538 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 12:53:10,539 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 12:53:10,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 12:53:10,540 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 12:53:10,540 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 12:53:10,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:53:10,540 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 12:53:10,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-31 12:53:10,540 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-31 12:53:10,540 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-01-31 12:53:10,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 12:53:10,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 12:53:10,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 12:53:10,748 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 12:53:10,749 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 12:53:10,750 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-01-31 12:53:10,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7354f499/3bec78d7e91846ea9ef07f49d6fda9ea/FLAG0d6352a61 [2022-01-31 12:53:11,091 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 12:53:11,091 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c [2022-01-31 12:53:11,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7354f499/3bec78d7e91846ea9ef07f49d6fda9ea/FLAG0d6352a61 [2022-01-31 12:53:11,525 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7354f499/3bec78d7e91846ea9ef07f49d6fda9ea [2022-01-31 12:53:11,527 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 12:53:11,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-31 12:53:11,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 12:53:11,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 12:53:11,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 12:53:11,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11cd637a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11, skipping insertion in model container [2022-01-31 12:53:11,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 12:53:11,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 12:53:11,622 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-01-31 12:53:11,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:53:11,639 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 12:53:11,646 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de61.c[368,381] [2022-01-31 12:53:11,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 12:53:11,673 INFO L208 MainTranslator]: Completed translation [2022-01-31 12:53:11,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11 WrapperNode [2022-01-31 12:53:11,673 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 12:53:11,674 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 12:53:11,674 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 12:53:11,674 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 12:53:11,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,719 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 12:53:11,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 12:53:11,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 12:53:11,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 12:53:11,722 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (1/1) ... [2022-01-31 12:53:11,726 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 12:53:11,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:11,757 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-01-31 12:53:11,789 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-01-31 12:53:11,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 12:53:11,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 12:53:11,804 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 12:53:11,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 12:53:11,805 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 12:53:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 12:53:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 12:53:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 12:53:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 12:53:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-01-31 12:53:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 12:53:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 12:53:11,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 12:53:11,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 12:53:11,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 12:53:11,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 12:53:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 12:53:11,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 12:53:11,857 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 12:53:11,858 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 12:53:12,004 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 12:53:12,008 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 12:53:12,008 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-31 12:53:12,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:12 BoogieIcfgContainer [2022-01-31 12:53:12,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 12:53:12,010 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-31 12:53:12,010 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-31 12:53:12,010 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-31 12:53:12,012 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:12" (1/1) ... [2022-01-31 12:53:12,197 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-01-31 12:53:12,198 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_4) (= v_main_~y~0_8 (+ v_main_~y~0_9 1)) (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_9} OutVars{main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] to Formula: (let ((.cse0 (mod v_main_~x~0_4 4294967296))) (or (and (= |v_main_#t~post5_3| |v_main_#t~post5_1|) (= v_main_~y~0_9 v_main_~y~0_8) (= v_main_~x~0_4 v_main_~x~0_3) (= |v_main_#t~post6_3| |v_main_#t~post6_1|) (<= .cse0 0)) (and (= v_main_~x~0_3 (+ (* (- 1) v_main_~y~0_8) v_main_~x~0_4 v_main_~y~0_9)) (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~x~0_4 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1)) (not (<= (+ v_main_~y~0_9 v_it_1 1) v_main_~y~0_8)))) (< 0 .cse0) (< v_main_~y~0_9 v_main_~y~0_8)))) InVars {main_~y~0=v_main_~y~0_9, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_4, main_#t~post6=|v_main_#t~post6_3|} OutVars{main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_1|, main_~x~0=v_main_~x~0_3, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] [2022-01-31 12:53:12,332 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-01-31 12:53:12,332 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_8 (+ v_main_~x~0_9 1)) (< 0 (mod v_main_~z~0_11 4294967296)) (= v_main_~z~0_11 (+ v_main_~z~0_10 1))) InVars {main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_11} OutVars{main_~x~0=v_main_~x~0_8, main_~z~0=v_main_~z~0_10, main_#t~post8=|v_main_#t~post8_1|, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] to Formula: (let ((.cse0 (mod v_main_~z~0_11 4294967296))) (or (and (< v_main_~z~0_10 v_main_~z~0_11) (= v_main_~x~0_8 (+ v_main_~z~0_11 v_main_~x~0_9 (* (- 1) v_main_~z~0_10))) (< 0 .cse0) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (not (<= (+ v_main_~z~0_10 v_it_2 1) v_main_~z~0_11)) (< 0 (mod (+ v_main_~z~0_11 (* v_it_2 4294967295)) 4294967296))))) (and (= v_main_~x~0_9 v_main_~x~0_8) (= v_main_~z~0_11 v_main_~z~0_10) (= |v_main_#t~post7_3| |v_main_#t~post7_1|) (<= .cse0 0) (= |v_main_#t~post8_3| |v_main_#t~post8_1|)))) InVars {main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, main_#t~post7=|v_main_#t~post7_3|} OutVars{main_~x~0=v_main_~x~0_8, main_#t~post8=|v_main_#t~post8_1|, main_~z~0=v_main_~z~0_10, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] [2022-01-31 12:53:12,384 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-01-31 12:53:12,384 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_5 4294967296)) (= (+ v_main_~z~0_3 1) v_main_~z~0_2) (= v_main_~y~0_5 (+ v_main_~y~0_4 1))) InVars {main_~z~0=v_main_~z~0_3, main_~y~0=v_main_~y~0_5} OutVars{main_#t~post10=|v_main_#t~post10_1|, main_~z~0=v_main_~z~0_2, main_~y~0=v_main_~y~0_4, main_#t~post9=|v_main_#t~post9_1|} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] to Formula: (let ((.cse0 (mod v_main_~y~0_5 4294967296))) (or (and (= v_main_~y~0_4 v_main_~y~0_5) (= |v_main_#t~post10_3| |v_main_#t~post10_1|) (= v_main_~z~0_3 v_main_~z~0_2) (= |v_main_#t~post9_3| |v_main_#t~post9_1|) (<= .cse0 0)) (and (= v_main_~y~0_4 (+ v_main_~y~0_5 v_main_~z~0_3 (* (- 1) v_main_~z~0_2))) (< 0 .cse0) (forall ((v_it_3 Int)) (or (not (<= (+ v_main_~z~0_3 v_it_3 1) v_main_~z~0_2)) (not (<= 1 v_it_3)) (< 0 (mod (+ v_main_~y~0_5 (* v_it_3 4294967295)) 4294967296)))) (< v_main_~z~0_3 v_main_~z~0_2)))) InVars {main_~y~0=v_main_~y~0_5, main_#t~post10=|v_main_#t~post10_3|, main_#t~post9=|v_main_#t~post9_3|, main_~z~0=v_main_~z~0_3} OutVars{main_~y~0=v_main_~y~0_4, main_#t~post10=|v_main_#t~post10_1|, main_#t~post9=|v_main_#t~post9_1|, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_#t~post10, main_~z~0, main_~y~0, main_#t~post9] [2022-01-31 12:53:12,453 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-01-31 12:53:12,453 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~x~0_7 (+ v_main_~x~0_6 1)) (< 0 (mod v_main_~x~0_7 4294967296)) (= v_main_~y~0_10 (+ v_main_~y~0_11 1))) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_11} OutVars{main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_10, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] to Formula: (let ((.cse0 (mod v_main_~x~0_7 4294967296))) (or (and (forall ((v_it_4 Int)) (or (not (<= (+ v_main_~x~0_6 v_it_4 1) v_main_~x~0_7)) (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_7) 4294967296)) (not (<= 1 v_it_4)))) (< 0 .cse0) (= v_main_~y~0_10 (+ (* (- 1) v_main_~x~0_6) v_main_~y~0_11 v_main_~x~0_7)) (< v_main_~x~0_6 v_main_~x~0_7)) (and (= |v_main_#t~post12_3| |v_main_#t~post12_1|) (= |v_main_#t~post11_3| |v_main_#t~post11_1|) (<= .cse0 0) (= v_main_~y~0_11 v_main_~y~0_10) (= v_main_~x~0_7 v_main_~x~0_6)))) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_7, main_#t~post11=|v_main_#t~post11_3|, main_#t~post12=|v_main_#t~post12_3|} OutVars{main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_6, main_#t~post11=|v_main_#t~post11_1|, main_#t~post12=|v_main_#t~post12_1|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post11, main_#t~post12] [2022-01-31 12:53:12,513 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-01-31 12:53:12,513 INFO L91 elerationTransformer]: Accelerated Formula: (and (= v_main_~z~0_13 (+ v_main_~z~0_12 1)) (= v_main_~x~0_10 (+ v_main_~x~0_11 1)) (< 0 (mod v_main_~z~0_13 4294967296))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] to Formula: (let ((.cse0 (mod v_main_~z~0_13 4294967296))) (or (and (= v_main_~z~0_12 (+ v_main_~x~0_11 v_main_~z~0_13 (* (- 1) v_main_~x~0_10))) (< v_main_~x~0_11 v_main_~x~0_10) (forall ((v_it_5 Int)) (or (< 0 (mod (+ v_main_~z~0_13 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)) (not (<= (+ v_main_~x~0_11 v_it_5 1) v_main_~x~0_10)))) (< 0 .cse0)) (and (= v_main_~x~0_11 v_main_~x~0_10) (= |v_main_#t~post14_3| |v_main_#t~post14_1|) (<= .cse0 0) (= v_main_~z~0_13 v_main_~z~0_12) (= |v_main_#t~post13_3| |v_main_#t~post13_1|)))) InVars {main_~x~0=v_main_~x~0_11, main_~z~0=v_main_~z~0_13, main_#t~post13=|v_main_#t~post13_3|, main_#t~post14=|v_main_#t~post14_3|} OutVars{main_~x~0=v_main_~x~0_10, main_~z~0=v_main_~z~0_12, main_#t~post13=|v_main_#t~post13_1|, main_#t~post14=|v_main_#t~post14_1|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post13, main_#t~post14] [2022-01-31 12:53:12,568 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-01-31 12:53:12,569 INFO L91 elerationTransformer]: Accelerated Formula: (and (< 0 (mod v_main_~y~0_7 4294967296)) (= v_main_~y~0_7 (+ v_main_~y~0_6 1)) (= v_main_~z~0_4 (+ v_main_~z~0_5 1))) InVars {main_~z~0=v_main_~z~0_5, main_~y~0=v_main_~y~0_7} OutVars{main_~z~0=v_main_~z~0_4, main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] to Formula: (let ((.cse0 (mod v_main_~y~0_7 4294967296))) (or (and (= |v_main_#t~post15_3| |v_main_#t~post15_1|) (= |v_main_#t~post16_3| |v_main_#t~post16_1|) (= v_main_~y~0_7 v_main_~y~0_6) (= v_main_~z~0_5 v_main_~z~0_4) (<= .cse0 0)) (and (< 0 .cse0) (< v_main_~z~0_5 v_main_~z~0_4) (forall ((v_it_6 Int)) (or (not (<= 1 v_it_6)) (not (<= (+ v_main_~z~0_5 v_it_6 1) v_main_~z~0_4)) (< 0 (mod (+ v_main_~y~0_7 (* v_it_6 4294967295)) 4294967296)))) (= v_main_~y~0_6 (+ (* (- 1) v_main_~z~0_4) v_main_~y~0_7 v_main_~z~0_5))))) InVars {main_#t~post15=|v_main_#t~post15_3|, main_~y~0=v_main_~y~0_7, main_#t~post16=|v_main_#t~post16_3|, main_~z~0=v_main_~z~0_5} OutVars{main_#t~post15=|v_main_#t~post15_1|, main_#t~post16=|v_main_#t~post16_1|, main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_4} AuxVars[] AssignedVars[main_~z~0, main_#t~post15, main_#t~post16, main_~y~0] [2022-01-31 12:53:12,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:53:12 BasicIcfg [2022-01-31 12:53:12,572 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-31 12:53:12,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 12:53:12,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 12:53:12,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 12:53:12,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 12:53:11" (1/4) ... [2022-01-31 12:53:12,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65142138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:12, skipping insertion in model container [2022-01-31 12:53:12,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 12:53:11" (2/4) ... [2022-01-31 12:53:12,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65142138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 12:53:12, skipping insertion in model container [2022-01-31 12:53:12,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 12:53:12" (3/4) ... [2022-01-31 12:53:12,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65142138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 12:53:12, skipping insertion in model container [2022-01-31 12:53:12,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 31.01 12:53:12" (4/4) ... [2022-01-31 12:53:12,577 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de61.cJordan [2022-01-31 12:53:12,580 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-01-31 12:53:12,580 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 12:53:12,604 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 12:53:12,608 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-31 12:53:12,608 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 12:53:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 12:53:12,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:53:12,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:12,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:12,620 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:12,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash 430051023, now seen corresponding path program 1 times [2022-01-31 12:53:12,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:12,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165426033] [2022-01-31 12:53:12,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:12,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:12,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:12,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:12,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165426033] [2022-01-31 12:53:12,704 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165426033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:12,704 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:53:12,705 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-31 12:53:12,705 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059483011] [2022-01-31 12:53:12,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:12,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-31 12:53:12,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:12,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-31 12:53:12,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-31 12:53:12,725 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 18 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:12,746 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-01-31 12:53:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-31 12:53:12,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 12:53:12,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:12,754 INFO L225 Difference]: With dead ends: 25 [2022-01-31 12:53:12,754 INFO L226 Difference]: Without dead ends: 18 [2022-01-31 12:53:12,755 INFO L932 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-01-31 12:53:12,757 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:12,757 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-31 12:53:12,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-31 12:53:12,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-31 12:53:12,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2022-01-31 12:53:12,775 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 17 [2022-01-31 12:53:12,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:12,775 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2022-01-31 12:53:12,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:12,776 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-01-31 12:53:12,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-31 12:53:12,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:12,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:12,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 12:53:12,776 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:12,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash -514488111, now seen corresponding path program 1 times [2022-01-31 12:53:12,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:12,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939684911] [2022-01-31 12:53:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:12,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:12,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:12,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:12,946 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:12,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939684911] [2022-01-31 12:53:12,946 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939684911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:12,946 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 12:53:12,946 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 12:53:12,946 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65346581] [2022-01-31 12:53:12,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:12,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 12:53:12,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:12,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 12:53:12,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-31 12:53:12,948 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:13,048 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2022-01-31 12:53:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 12:53:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-31 12:53:13,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:13,049 INFO L225 Difference]: With dead ends: 33 [2022-01-31 12:53:13,049 INFO L226 Difference]: Without dead ends: 30 [2022-01-31 12:53:13,050 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 12:53:13,050 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 29 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:13,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:53:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-31 12:53:13,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-01-31 12:53:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-01-31 12:53:13,054 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 17 [2022-01-31 12:53:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:13,054 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-01-31 12:53:13,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:13,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-01-31 12:53:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:13,055 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:13,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:13,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 12:53:13,055 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:13,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash 34479891, now seen corresponding path program 1 times [2022-01-31 12:53:13,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744666610] [2022-01-31 12:53:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:13,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:13,075 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-01-31 12:53:13,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:13,101 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-01-31 12:53:13,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:13,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:13,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744666610] [2022-01-31 12:53:13,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744666610] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:13,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324379946] [2022-01-31 12:53:13,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:13,231 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:13,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:13,255 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-01-31 12:53:13,277 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-01-31 12:53:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:13,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:53:13,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:13,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:53:13,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324379946] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:13,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:53:13,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-01-31 12:53:13,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936265428] [2022-01-31 12:53:13,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:13,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:53:13,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:13,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:53:13,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:53:13,448 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:13,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:13,504 INFO L93 Difference]: Finished difference Result 32 states and 45 transitions. [2022-01-31 12:53:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:53:13,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:53:13,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:13,507 INFO L225 Difference]: With dead ends: 32 [2022-01-31 12:53:13,507 INFO L226 Difference]: Without dead ends: 29 [2022-01-31 12:53:13,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:53:13,510 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:13,511 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 76 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:53:13,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-31 12:53:13,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-01-31 12:53:13,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 20 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:13,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2022-01-31 12:53:13,520 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 18 [2022-01-31 12:53:13,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:13,521 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2022-01-31 12:53:13,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:13,521 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2022-01-31 12:53:13,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:13,522 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:13,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:13,539 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-01-31 12:53:13,739 WARN L452 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-01-31 12:53:13,740 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:13,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1257458414, now seen corresponding path program 1 times [2022-01-31 12:53:13,740 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:13,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265505704] [2022-01-31 12:53:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:13,741 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:13,747 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:13,798 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.2))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:13,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:13,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:13,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:13,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265505704] [2022-01-31 12:53:13,933 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265505704] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:13,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712171801] [2022-01-31 12:53:13,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:13,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:13,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:13,949 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-01-31 12:53:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:14,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:53:14,003 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-01-31 12:53:14,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:14,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:18,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:18,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712171801] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:18,950 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:18,950 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-01-31 12:53:18,950 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956406889] [2022-01-31 12:53:18,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:18,951 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 12:53:18,951 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:18,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 12:53:18,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=297, Unknown=1, NotChecked=0, Total=380 [2022-01-31 12:53:18,951 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:19,094 INFO L93 Difference]: Finished difference Result 38 states and 56 transitions. [2022-01-31 12:53:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 12:53:19,095 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:53:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:19,095 INFO L225 Difference]: With dead ends: 38 [2022-01-31 12:53:19,095 INFO L226 Difference]: Without dead ends: 35 [2022-01-31 12:53:19,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=140, Invalid=509, Unknown=1, NotChecked=0, Total=650 [2022-01-31 12:53:19,096 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:19,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 72 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-01-31 12:53:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-31 12:53:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-01-31 12:53:19,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-01-31 12:53:19,099 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 18 [2022-01-31 12:53:19,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:19,099 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-01-31 12:53:19,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.7) internal successors, (34), 17 states have internal predecessors, (34), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2022-01-31 12:53:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:19,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:19,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:19,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:19,307 WARN L452 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-01-31 12:53:19,307 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:19,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:19,308 INFO L85 PathProgramCache]: Analyzing trace with hash 2030445491, now seen corresponding path program 1 times [2022-01-31 12:53:19,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:19,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446388822] [2022-01-31 12:53:19,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:19,308 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:19,314 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,325 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:19,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:19,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446388822] [2022-01-31 12:53:19,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446388822] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672570087] [2022-01-31 12:53:19,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:19,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:19,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:19,418 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-01-31 12:53:19,419 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-01-31 12:53:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:53:19,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:19,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:19,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:53:19,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672570087] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:19,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:53:19,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-01-31 12:53:19,567 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058810882] [2022-01-31 12:53:19,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:19,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:53:19,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:19,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:53:19,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:53:19,567 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:19,607 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-01-31 12:53:19,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:53:19,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:53:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:19,608 INFO L225 Difference]: With dead ends: 34 [2022-01-31 12:53:19,608 INFO L226 Difference]: Without dead ends: 31 [2022-01-31 12:53:19,608 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:53:19,609 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:19,609 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 66 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:53:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-31 12:53:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-01-31 12:53:19,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.6) internal successors, (40), 25 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-01-31 12:53:19,611 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 18 [2022-01-31 12:53:19,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:19,611 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2022-01-31 12:53:19,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:19,611 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2022-01-31 12:53:19,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:19,612 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:19,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:19,649 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-01-31 12:53:19,812 WARN L452 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-01-31 12:53:19,813 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:19,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:19,814 INFO L85 PathProgramCache]: Analyzing trace with hash 223241102, now seen corresponding path program 1 times [2022-01-31 12:53:19,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:19,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638017248] [2022-01-31 12:53:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:19,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:19,818 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-01-31 12:53:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,833 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-01-31 12:53:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:19,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:19,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:19,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638017248] [2022-01-31 12:53:19,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638017248] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:19,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443884321] [2022-01-31 12:53:19,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:19,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:19,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:19,956 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-01-31 12:53:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:19,995 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-01-31 12:53:19,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:53:20,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:20,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:53:20,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [443884321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:20,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:53:20,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2022-01-31 12:53:20,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471780301] [2022-01-31 12:53:20,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:20,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 12:53:20,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:20,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 12:53:20,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:53:20,149 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:20,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:20,187 INFO L93 Difference]: Finished difference Result 36 states and 52 transitions. [2022-01-31 12:53:20,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 12:53:20,187 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:53:20,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:20,188 INFO L225 Difference]: With dead ends: 36 [2022-01-31 12:53:20,188 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 12:53:20,188 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-01-31 12:53:20,188 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:20,189 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 74 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:53:20,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 12:53:20,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-01-31 12:53:20,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:20,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2022-01-31 12:53:20,191 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 18 [2022-01-31 12:53:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:20,191 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2022-01-31 12:53:20,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2022-01-31 12:53:20,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:20,192 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:20,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:20,210 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-01-31 12:53:20,407 WARN L452 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-01-31 12:53:20,408 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:20,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1522150354, now seen corresponding path program 1 times [2022-01-31 12:53:20,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:20,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496107412] [2022-01-31 12:53:20,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:20,409 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:20,412 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-01-31 12:53:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:20,425 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-01-31 12:53:20,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:20,521 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:20,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496107412] [2022-01-31 12:53:20,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496107412] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:20,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660741741] [2022-01-31 12:53:20,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:20,521 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:20,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:20,522 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-01-31 12:53:20,523 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-01-31 12:53:20,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:20,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:53:20,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:20,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:53:20,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660741741] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:20,680 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:53:20,680 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-01-31 12:53:20,680 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975966478] [2022-01-31 12:53:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:20,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:53:20,681 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:20,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:53:20,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:53:20,681 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:20,721 INFO L93 Difference]: Finished difference Result 39 states and 58 transitions. [2022-01-31 12:53:20,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:53:20,721 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:53:20,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:20,722 INFO L225 Difference]: With dead ends: 39 [2022-01-31 12:53:20,722 INFO L226 Difference]: Without dead ends: 36 [2022-01-31 12:53:20,722 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:53:20,722 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:20,723 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 66 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:53:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-31 12:53:20,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-01-31 12:53:20,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:20,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 50 transitions. [2022-01-31 12:53:20,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 50 transitions. Word has length 18 [2022-01-31 12:53:20,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:20,725 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 50 transitions. [2022-01-31 12:53:20,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:20,725 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 50 transitions. [2022-01-31 12:53:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 12:53:20,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:20,726 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:20,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:20,935 WARN L452 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-01-31 12:53:20,935 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:20,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1504591698, now seen corresponding path program 1 times [2022-01-31 12:53:20,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:20,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535782034] [2022-01-31 12:53:20,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:20,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:20,940 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-01-31 12:53:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:20,948 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-01-31 12:53:21,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:21,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535782034] [2022-01-31 12:53:21,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535782034] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:21,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [263190964] [2022-01-31 12:53:21,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:21,080 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:21,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:21,081 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-01-31 12:53:21,082 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-01-31 12:53:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:21,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-01-31 12:53:21,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:21,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:22,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [263190964] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:22,230 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:22,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-01-31 12:53:22,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843805114] [2022-01-31 12:53:22,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:22,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 12:53:22,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 12:53:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:53:22,231 INFO L87 Difference]: Start difference. First operand 33 states and 50 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:22,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:22,491 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2022-01-31 12:53:22,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 12:53:22,492 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-01-31 12:53:22,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:22,493 INFO L225 Difference]: With dead ends: 49 [2022-01-31 12:53:22,493 INFO L226 Difference]: Without dead ends: 46 [2022-01-31 12:53:22,493 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2022-01-31 12:53:22,493 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 61 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:22,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 73 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-01-31 12:53:22,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-31 12:53:22,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2022-01-31 12:53:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 31 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:22,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2022-01-31 12:53:22,496 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 55 transitions. Word has length 18 [2022-01-31 12:53:22,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:22,496 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 55 transitions. [2022-01-31 12:53:22,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 15 states have internal predecessors, (31), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2022-01-31 12:53:22,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:53:22,497 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:22,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:22,515 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-01-31 12:53:22,707 WARN L452 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-01-31 12:53:22,707 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1095597292, now seen corresponding path program 1 times [2022-01-31 12:53:22,708 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:22,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720661238] [2022-01-31 12:53:22,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:22,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:22,713 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-01-31 12:53:22,714 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:22,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:22,726 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_9 .cse0 (* (- 4294967296) (div (+ main_~y~0_9 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:22,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:22,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720661238] [2022-01-31 12:53:22,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720661238] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:22,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426001883] [2022-01-31 12:53:22,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:22,856 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:22,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:22,872 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-01-31 12:53:22,873 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-01-31 12:53:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:22,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:53:22,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:23,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:23,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:31,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426001883] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:31,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:31,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 23 [2022-01-31 12:53:31,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104317234] [2022-01-31 12:53:31,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:31,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 12:53:31,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 12:53:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=392, Unknown=3, NotChecked=0, Total=506 [2022-01-31 12:53:31,766 INFO L87 Difference]: Start difference. First operand 36 states and 55 transitions. Second operand has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:32,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:32,023 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2022-01-31 12:53:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 12:53:32,024 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:53:32,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:32,024 INFO L225 Difference]: With dead ends: 55 [2022-01-31 12:53:32,024 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 12:53:32,025 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=233, Invalid=820, Unknown=3, NotChecked=0, Total=1056 [2022-01-31 12:53:32,025 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:32,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 89 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 129 Invalid, 0 Unknown, 37 Unchecked, 0.1s Time] [2022-01-31 12:53:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 12:53:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-01-31 12:53:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 33 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:32,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 59 transitions. [2022-01-31 12:53:32,028 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 59 transitions. Word has length 19 [2022-01-31 12:53:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:32,028 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 59 transitions. [2022-01-31 12:53:32,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 20 states have internal predecessors, (35), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:32,028 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 59 transitions. [2022-01-31 12:53:32,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:53:32,028 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:32,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:32,047 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-01-31 12:53:32,235 WARN L452 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-01-31 12:53:32,235 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:32,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:32,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1868584369, now seen corresponding path program 1 times [2022-01-31 12:53:32,236 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:32,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477321104] [2022-01-31 12:53:32,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:32,236 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:32,239 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-01-31 12:53:32,240 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:32,254 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-01-31 12:53:32,256 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_9 .cse0 (* (- 4294967296) (div (+ main_~z~0_9 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:32,352 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:32,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477321104] [2022-01-31 12:53:32,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477321104] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:32,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754010754] [2022-01-31 12:53:32,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:32,352 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:32,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:32,353 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-01-31 12:53:32,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-31 12:53:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:32,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:53:32,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:32,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:53:32,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:53:32,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754010754] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:32,504 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:53:32,504 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-01-31 12:53:32,504 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903554879] [2022-01-31 12:53:32,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:32,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:53:32,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:32,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:53:32,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-31 12:53:32,505 INFO L87 Difference]: Start difference. First operand 38 states and 59 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:32,548 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2022-01-31 12:53:32,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:53:32,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:53:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:32,550 INFO L225 Difference]: With dead ends: 45 [2022-01-31 12:53:32,550 INFO L226 Difference]: Without dead ends: 42 [2022-01-31 12:53:32,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-01-31 12:53:32,550 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:32,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 67 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:53:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-31 12:53:32,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2022-01-31 12:53:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.65625) internal successors, (53), 32 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 57 transitions. [2022-01-31 12:53:32,558 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 57 transitions. Word has length 19 [2022-01-31 12:53:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:32,558 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 57 transitions. [2022-01-31 12:53:32,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 57 transitions. [2022-01-31 12:53:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:53:32,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:32,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:32,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-31 12:53:32,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-31 12:53:32,775 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:32,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 61379980, now seen corresponding path program 1 times [2022-01-31 12:53:32,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:32,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649233064] [2022-01-31 12:53:32,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:32,776 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:32,784 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-01-31 12:53:32,785 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-01-31 12:53:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:32,796 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-01-31 12:53:32,805 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-01-31 12:53:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:32,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:32,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:32,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649233064] [2022-01-31 12:53:32,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649233064] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:32,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33463607] [2022-01-31 12:53:32,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:32,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:32,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:32,939 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:53:32,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-31 12:53:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:32,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:53:32,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:33,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:53:33,104 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:53:33,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33463607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:53:33,104 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:53:33,104 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-01-31 12:53:33,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607708442] [2022-01-31 12:53:33,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:53:33,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 12:53:33,105 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:33,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 12:53:33,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-01-31 12:53:33,105 INFO L87 Difference]: Start difference. First operand 37 states and 57 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:33,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:33,171 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2022-01-31 12:53:33,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 12:53:33,171 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:53:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:33,172 INFO L225 Difference]: With dead ends: 46 [2022-01-31 12:53:33,172 INFO L226 Difference]: Without dead ends: 43 [2022-01-31 12:53:33,172 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:53:33,172 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:33,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 75 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:53:33,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-31 12:53:33,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-01-31 12:53:33,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 30 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2022-01-31 12:53:33,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 19 [2022-01-31 12:53:33,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:33,174 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2022-01-31 12:53:33,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:33,174 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2022-01-31 12:53:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:53:33,175 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:33,175 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:33,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:33,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:33,375 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash 353225841, now seen corresponding path program 2 times [2022-01-31 12:53:33,376 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:33,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567030919] [2022-01-31 12:53:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:33,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:33,379 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:33,379 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:33,388 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:33,389 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_12 .cse0 (* (- 4294967296) (div (+ main_~y~0_12 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:33,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:33,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:33,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567030919] [2022-01-31 12:53:33,509 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567030919] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:33,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538020933] [2022-01-31 12:53:33,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-31 12:53:33,509 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:33,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:33,510 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:53:33,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-31 12:53:33,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-31 12:53:33,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-31 12:53:33,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:53:33,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:33,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:33,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:39,140 WARN L838 $PredicateComparison]: unable to prove that (forall ((aux_mod_v_main_~z~0_28_31 Int)) (or (> 0 aux_mod_v_main_~z~0_28_31) (>= aux_mod_v_main_~z~0_28_31 4294967296) (= aux_mod_v_main_~z~0_28_31 (mod c_main_~n~0 4294967296)) (let ((.cse0 (< 0 (mod c_main_~y~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~z~0_28_31 Int)) (not (= (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31)) c_main_~z~0)))) (or (and (or (forall ((aux_div_v_main_~z~0_28_31 Int)) (or (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (<= (+ v_it_6 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31))) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))))) (not (< c_main_~z~0 (+ aux_mod_v_main_~z~0_28_31 (* 4294967296 aux_div_v_main_~z~0_28_31)))))) (< 0 (mod (+ (* aux_mod_v_main_~z~0_28_31 4294967295) c_main_~y~0 c_main_~z~0) 4294967296))) (forall ((aux_div_v_main_~z~0_28_31 Int) (aux_div_v_main_~y~0_28_31 Int) (aux_mod_v_main_~y~0_28_31 Int)) (let ((.cse1 (* aux_div_v_main_~y~0_28_31 4294967296))) (or (<= aux_mod_v_main_~y~0_28_31 0) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ (* v_it_6 4294967295) c_main_~y~0) 4294967296))) (<= (+ v_it_6 (* aux_div_v_main_~y~0_28_31 4294967296) aux_mod_v_main_~y~0_28_31 1) c_main_~y~0))) (<= (+ aux_mod_v_main_~z~0_28_31 .cse1 (* 4294967296 aux_div_v_main_~z~0_28_31) aux_mod_v_main_~y~0_28_31) (+ c_main_~y~0 c_main_~z~0)) (<= 4294967296 aux_mod_v_main_~y~0_28_31) (exists ((v_it_6 Int)) (and (<= (+ v_it_6 c_main_~y~0 c_main_~z~0 1) (+ aux_mod_v_main_~z~0_28_31 (* aux_div_v_main_~y~0_28_31 4294967296) (* 4294967296 aux_div_v_main_~z~0_28_31) aux_mod_v_main_~y~0_28_31)) (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_28_31 (* v_it_6 4294967295)) 4294967296))))) (<= c_main_~y~0 (+ .cse1 aux_mod_v_main_~y~0_28_31)))))) (not .cse0)))))) is different from false [2022-01-31 12:53:43,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-31 12:53:43,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538020933] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:43,793 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:43,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 10] total 19 [2022-01-31 12:53:43,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604043022] [2022-01-31 12:53:43,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:43,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 12:53:43,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:43,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 12:53:43,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=238, Unknown=5, NotChecked=32, Total=342 [2022-01-31 12:53:43,794 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:43,939 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-01-31 12:53:43,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 12:53:43,940 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:53:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:43,940 INFO L225 Difference]: With dead ends: 50 [2022-01-31 12:53:43,940 INFO L226 Difference]: Without dead ends: 44 [2022-01-31 12:53:43,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=122, Invalid=429, Unknown=5, NotChecked=44, Total=600 [2022-01-31 12:53:43,941 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 37 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 42 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:43,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 77 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 42 Unchecked, 0.1s Time] [2022-01-31 12:53:43,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-31 12:53:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2022-01-31 12:53:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 33 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:43,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 58 transitions. [2022-01-31 12:53:43,943 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 58 transitions. Word has length 19 [2022-01-31 12:53:43,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:43,943 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 58 transitions. [2022-01-31 12:53:43,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:43,943 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 58 transitions. [2022-01-31 12:53:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:53:43,943 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:43,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:43,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:44,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-31 12:53:44,155 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:44,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1453978548, now seen corresponding path program 1 times [2022-01-31 12:53:44,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:44,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67502932] [2022-01-31 12:53:44,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:44,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:44,159 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:44,160 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:44,168 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:44,169 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:44,337 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:44,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67502932] [2022-01-31 12:53:44,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67502932] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:44,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2067264633] [2022-01-31 12:53:44,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:44,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:44,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:44,339 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:53:44,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-31 12:53:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:44,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:53:44,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:44,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:53:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:53:54,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2067264633] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:53:54,579 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:53:54,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-01-31 12:53:54,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773924445] [2022-01-31 12:53:54,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:53:54,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-31 12:53:54,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:53:54,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-31 12:53:54,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=364, Unknown=4, NotChecked=0, Total=462 [2022-01-31 12:53:54,580 INFO L87 Difference]: Start difference. First operand 38 states and 58 transitions. Second operand has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:55,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:53:55,772 INFO L93 Difference]: Finished difference Result 52 states and 79 transitions. [2022-01-31 12:53:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 12:53:55,773 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:53:55,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:53:55,773 INFO L225 Difference]: With dead ends: 52 [2022-01-31 12:53:55,773 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 12:53:55,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=209, Invalid=779, Unknown=4, NotChecked=0, Total=992 [2022-01-31 12:53:55,774 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:53:55,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 99 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 40 Unchecked, 0.1s Time] [2022-01-31 12:53:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 12:53:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2022-01-31 12:53:55,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.6470588235294117) internal successors, (56), 34 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2022-01-31 12:53:55,776 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 19 [2022-01-31 12:53:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:53:55,776 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2022-01-31 12:53:55,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 19 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:53:55,776 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2022-01-31 12:53:55,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:53:55,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:53:55,777 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:53:55,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-31 12:53:55,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-31 12:53:55,983 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:53:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:53:55,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1642739759, now seen corresponding path program 1 times [2022-01-31 12:53:55,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:53:55,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29525585] [2022-01-31 12:53:55,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:55,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:53:55,987 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-01-31 12:53:55,987 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:55,996 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-01-31 12:53:55,998 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_10 .cse0 (* (- 4294967296) (div (+ main_~y~0_10 .cse0) 4294967296)))) 0)) [2022-01-31 12:53:56,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:53:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:56,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:56,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:53:56,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29525585] [2022-01-31 12:53:56,085 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29525585] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:53:56,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003809926] [2022-01-31 12:53:56,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:53:56,085 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:53:56,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:53:56,086 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:53:56,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-31 12:53:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:53:56,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:53:56,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:53:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:53:56,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:18,774 WARN L860 $PredicateComparison]: unable to prove that (or (< 0 (mod c_main_~y~0 4294967296)) (forall ((aux_mod_v_main_~z~0_38_31 Int)) (or (> 0 aux_mod_v_main_~z~0_38_31) (= aux_mod_v_main_~z~0_38_31 (mod c_main_~n~0 4294967296)) (and (or (forall ((aux_mod_v_main_~y~0_36_31 Int)) (or (< 0 aux_mod_v_main_~y~0_36_31) (let ((.cse0 (< 0 (mod c_main_~x~0 4294967296)))) (and (or .cse0 (forall ((aux_div_v_main_~y~0_36_31 Int)) (not (= (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31) c_main_~y~0)))) (or (not .cse0) (forall ((aux_div_v_main_~y~0_36_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)))))))) (< aux_mod_v_main_~y~0_36_31 0))) (forall ((aux_div_v_main_~z~0_38_31 Int)) (not (= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~y~0)))) (or (not (< 0 (mod c_main_~x~0 4294967296))) (forall ((aux_mod_v_main_~y~0_36_31 Int) (aux_div_v_main_~y~0_36_31 Int) (aux_div_v_main_~z~0_38_31 Int)) (or (exists ((v_it_4 Int)) (and (not (< 0 (mod (+ (* v_it_4 4294967295) c_main_~x~0) 4294967296))) (<= (+ v_it_4 c_main_~y~0 1) (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31)) (<= 1 v_it_4))) (not (< c_main_~y~0 (+ (* aux_div_v_main_~y~0_36_31 4294967296) aux_mod_v_main_~y~0_36_31))) (exists ((v_it_6 Int)) (and (<= 1 v_it_6) (not (< 0 (mod (+ aux_mod_v_main_~y~0_36_31 (* v_it_6 4294967295)) 4294967296))) (<= (+ v_it_6 c_main_~y~0 1) (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31))))) (<= 4294967296 aux_mod_v_main_~y~0_36_31) (<= aux_mod_v_main_~y~0_36_31 0) (<= (+ aux_mod_v_main_~z~0_38_31 (* 4294967296 aux_div_v_main_~z~0_38_31)) c_main_~y~0))))) (>= aux_mod_v_main_~z~0_38_31 4294967296)))) is different from true [2022-01-31 12:55:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:22,196 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003809926] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:22,196 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:22,196 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 19 [2022-01-31 12:55:22,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597466734] [2022-01-31 12:55:22,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:22,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 12:55:22,197 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:22,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 12:55:22,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=217, Unknown=37, NotChecked=32, Total=342 [2022-01-31 12:55:22,197 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:48,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:48,632 INFO L93 Difference]: Finished difference Result 50 states and 77 transitions. [2022-01-31 12:55:48,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 12:55:48,632 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:55:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:48,633 INFO L225 Difference]: With dead ends: 50 [2022-01-31 12:55:48,633 INFO L226 Difference]: Without dead ends: 47 [2022-01-31 12:55:48,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 107.7s TimeCoverageRelationStatistics Valid=114, Invalid=441, Unknown=49, NotChecked=46, Total=650 [2022-01-31 12:55:48,634 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 40 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:48,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 119 Unchecked, 0.1s Time] [2022-01-31 12:55:48,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-31 12:55:48,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-01-31 12:55:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:48,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-01-31 12:55:48,645 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-01-31 12:55:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:48,646 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-01-31 12:55:48,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 16 states have internal predecessors, (28), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-01-31 12:55:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:48,646 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:48,646 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:48,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-01-31 12:55:48,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-31 12:55:48,847 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:48,848 INFO L85 PathProgramCache]: Analyzing trace with hash -869752682, now seen corresponding path program 1 times [2022-01-31 12:55:48,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:48,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629604480] [2022-01-31 12:55:48,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:48,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:48,851 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-01-31 12:55:48,852 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:48,877 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-01-31 12:55:48,878 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:48,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:48,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:48,978 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:48,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629604480] [2022-01-31 12:55:48,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629604480] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:48,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4719527] [2022-01-31 12:55:48,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:48,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:48,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:48,980 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:55:48,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-31 12:55:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:49,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:55:49,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:55:49,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:55:49,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4719527] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:55:49,146 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:55:49,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2022-01-31 12:55:49,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273584793] [2022-01-31 12:55:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:55:49,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 12:55:49,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:49,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 12:55:49,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2022-01-31 12:55:49,147 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:49,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:49,181 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2022-01-31 12:55:49,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:55:49,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:55:49,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:49,182 INFO L225 Difference]: With dead ends: 51 [2022-01-31 12:55:49,182 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 12:55:49,182 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 12:55:49,182 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:49,182 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-01-31 12:55:49,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 12:55:49,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 41. [2022-01-31 12:55:49,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 36 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:49,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2022-01-31 12:55:49,184 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 19 [2022-01-31 12:55:49,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:49,184 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2022-01-31 12:55:49,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:49,185 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2022-01-31 12:55:49,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:49,185 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:49,185 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:49,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-31 12:55:49,385 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-31 12:55:49,385 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1138278570, now seen corresponding path program 1 times [2022-01-31 12:55:49,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:49,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022449875] [2022-01-31 12:55:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:49,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:49,389 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-01-31 12:55:49,389 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-01-31 12:55:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:49,396 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-01-31 12:55:49,398 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-01-31 12:55:49,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:49,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:49,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022449875] [2022-01-31 12:55:49,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022449875] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:49,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763825771] [2022-01-31 12:55:49,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:49,505 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:49,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:49,506 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:55:49,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-01-31 12:55:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:49,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:55:49,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:49,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:55:49,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:55:49,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763825771] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:55:49,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:55:49,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2022-01-31 12:55:49,652 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109042612] [2022-01-31 12:55:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:55:49,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:55:49,652 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:55:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-01-31 12:55:49,653 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:49,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:49,691 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-01-31 12:55:49,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:55:49,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:55:49,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:49,692 INFO L225 Difference]: With dead ends: 54 [2022-01-31 12:55:49,692 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 12:55:49,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 12:55:49,693 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:49,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 71 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:55:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 12:55:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 42. [2022-01-31 12:55:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-01-31 12:55:49,695 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-01-31 12:55:49,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:49,695 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-01-31 12:55:49,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:49,695 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-01-31 12:55:49,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:49,695 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:49,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:49,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-01-31 12:55:49,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:49,896 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:49,896 INFO L85 PathProgramCache]: Analyzing trace with hash 84699953, now seen corresponding path program 1 times [2022-01-31 12:55:49,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:49,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180964387] [2022-01-31 12:55:49,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:49,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:49,899 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-01-31 12:55:49,900 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:49,924 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-01-31 12:55:49,927 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.4))) (+ main_~y~0_5 .cse0 (* (- 4294967296) (div (+ main_~y~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:50,081 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180964387] [2022-01-31 12:55:50,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180964387] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:50,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609220644] [2022-01-31 12:55:50,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:50,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:50,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:50,083 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:55:50,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-01-31 12:55:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:50,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-31 12:55:50,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:50,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:50,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:53,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:53,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609220644] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:53,113 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:53,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 20 [2022-01-31 12:55:53,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669072110] [2022-01-31 12:55:53,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:53,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 12:55:53,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:53,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 12:55:53,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-01-31 12:55:53,115 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:53,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:53,429 INFO L93 Difference]: Finished difference Result 62 states and 99 transitions. [2022-01-31 12:55:53,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 12:55:53,429 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:55:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:53,430 INFO L225 Difference]: With dead ends: 62 [2022-01-31 12:55:53,430 INFO L226 Difference]: Without dead ends: 58 [2022-01-31 12:55:53,430 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2022-01-31 12:55:53,430 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 56 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:53,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 71 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 136 Invalid, 0 Unknown, 33 Unchecked, 0.1s Time] [2022-01-31 12:55:53,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-31 12:55:53,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2022-01-31 12:55:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-01-31 12:55:53,434 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-01-31 12:55:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:53,434 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-01-31 12:55:53,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-01-31 12:55:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:53,434 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:53,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:53,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-01-31 12:55:53,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-01-31 12:55:53,635 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:53,635 INFO L85 PathProgramCache]: Analyzing trace with hash 857687030, now seen corresponding path program 1 times [2022-01-31 12:55:53,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:53,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759861758] [2022-01-31 12:55:53,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:53,636 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:53,638 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-01-31 12:55:53,639 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:53,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:53,646 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-01-31 12:55:53,657 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.4))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:53,763 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:53,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759861758] [2022-01-31 12:55:53,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759861758] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:53,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723321413] [2022-01-31 12:55:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:53,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:53,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:53,772 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:55:53,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-01-31 12:55:53,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:53,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:55:53,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:53,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:55:53,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:55:53,959 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723321413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:55:53,959 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:55:53,959 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 15 [2022-01-31 12:55:53,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805331939] [2022-01-31 12:55:53,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:55:53,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:55:53,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:55:53,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:55:53,960 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:53,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:53,990 INFO L93 Difference]: Finished difference Result 51 states and 79 transitions. [2022-01-31 12:55:53,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:55:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:55:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:53,991 INFO L225 Difference]: With dead ends: 51 [2022-01-31 12:55:53,991 INFO L226 Difference]: Without dead ends: 48 [2022-01-31 12:55:53,991 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:55:53,992 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:53,992 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 78 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-01-31 12:55:53,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-31 12:55:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2022-01-31 12:55:53,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.6923076923076923) internal successors, (66), 39 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:53,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 70 transitions. [2022-01-31 12:55:53,994 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 70 transitions. Word has length 19 [2022-01-31 12:55:53,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:53,994 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 70 transitions. [2022-01-31 12:55:53,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:53,994 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 70 transitions. [2022-01-31 12:55:53,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:53,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:53,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:54,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-01-31 12:55:54,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-01-31 12:55:54,196 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:54,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:54,196 INFO L85 PathProgramCache]: Analyzing trace with hash -949517359, now seen corresponding path program 1 times [2022-01-31 12:55:54,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:54,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988308128] [2022-01-31 12:55:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:54,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:54,199 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-01-31 12:55:54,200 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-01-31 12:55:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:54,208 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:54,218 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_8 (* (- 4294967296) (div (+ .cse0 main_~x~0_8) 4294967296)))) 0)) [2022-01-31 12:55:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:54,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:54,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988308128] [2022-01-31 12:55:54,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988308128] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394842032] [2022-01-31 12:55:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:54,292 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:54,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:54,293 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:55:54,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-01-31 12:55:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:54,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-31 12:55:54,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:54,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 12:55:54,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-31 12:55:54,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394842032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 12:55:54,399 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-31 12:55:54,399 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2022-01-31 12:55:54,399 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097262518] [2022-01-31 12:55:54,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 12:55:54,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 12:55:54,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:54,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 12:55:54,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-01-31 12:55:54,400 INFO L87 Difference]: Start difference. First operand 44 states and 70 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:55:54,428 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2022-01-31 12:55:54,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 12:55:54,428 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:55:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:55:54,429 INFO L225 Difference]: With dead ends: 54 [2022-01-31 12:55:54,429 INFO L226 Difference]: Without dead ends: 51 [2022-01-31 12:55:54,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-01-31 12:55:54,430 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 14 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 12 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 12:55:54,430 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 85 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 12 Unchecked, 0.0s Time] [2022-01-31 12:55:54,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-01-31 12:55:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 43. [2022-01-31 12:55:54,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 38 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:54,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2022-01-31 12:55:54,434 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 19 [2022-01-31 12:55:54,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:55:54,434 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2022-01-31 12:55:54,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:55:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2022-01-31 12:55:54,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:55:54,435 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:55:54,435 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:55:54,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-01-31 12:55:54,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:54,653 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:55:54,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:55:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash -593960234, now seen corresponding path program 1 times [2022-01-31 12:55:54,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:55:54,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113936791] [2022-01-31 12:55:54,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:54,653 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:55:54,656 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-01-31 12:55:54,657 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:54,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:54,678 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:54,682 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:55:54,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:55:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:54,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:55:54,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:55:54,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113936791] [2022-01-31 12:55:54,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113936791] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:55:54,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808833620] [2022-01-31 12:55:54,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:55:54,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:55:54,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:55:54,809 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:55:54,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-01-31 12:55:54,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:55:54,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:55:54,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:55:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:55,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:55:57,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:55:57,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808833620] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:55:57,582 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:55:57,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2022-01-31 12:55:57,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408982833] [2022-01-31 12:55:57,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:55:57,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 12:55:57,582 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:55:57,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 12:55:57,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2022-01-31 12:55:57,583 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:00,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:56:00,010 INFO L93 Difference]: Finished difference Result 63 states and 101 transitions. [2022-01-31 12:56:00,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 12:56:00,010 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:56:00,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:56:00,011 INFO L225 Difference]: With dead ends: 63 [2022-01-31 12:56:00,011 INFO L226 Difference]: Without dead ends: 60 [2022-01-31 12:56:00,011 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=166, Invalid=588, Unknown=2, NotChecked=0, Total=756 [2022-01-31 12:56:00,011 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 71 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 12:56:00,012 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 123 Invalid, 0 Unknown, 54 Unchecked, 0.1s Time] [2022-01-31 12:56:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-31 12:56:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 42. [2022-01-31 12:56:00,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 37 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:00,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2022-01-31 12:56:00,013 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 19 [2022-01-31 12:56:00,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:56:00,013 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2022-01-31 12:56:00,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.736842105263158) internal successors, (33), 16 states have internal predecessors, (33), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:00,014 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2022-01-31 12:56:00,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:56:00,015 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:56:00,015 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:56:00,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-01-31 12:56:00,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:56:00,216 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:56:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:56:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 629018289, now seen corresponding path program 1 times [2022-01-31 12:56:00,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:56:00,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251840934] [2022-01-31 12:56:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:00,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:56:00,219 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-01-31 12:56:00,220 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:56:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:00,231 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:56:00,236 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.3))) (+ main_~y~0_6 .cse0 (* (- 4294967296) (div (+ main_~y~0_6 .cse0) 4294967296)))) 0)) [2022-01-31 12:56:00,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:56:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:00,380 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:56:00,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251840934] [2022-01-31 12:56:00,380 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251840934] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:56:00,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985613488] [2022-01-31 12:56:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:00,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:56:00,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:56:00,384 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:56:00,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-01-31 12:56:00,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:00,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:56:00,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:56:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:00,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:56:17,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:17,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985613488] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:56:17,375 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:56:17,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2022-01-31 12:56:17,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667638053] [2022-01-31 12:56:17,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:56:17,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 12:56:17,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:56:17,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 12:56:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=325, Unknown=5, NotChecked=0, Total=420 [2022-01-31 12:56:17,376 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:56:17,892 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2022-01-31 12:56:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 12:56:17,892 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:56:17,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:56:17,893 INFO L225 Difference]: With dead ends: 55 [2022-01-31 12:56:17,893 INFO L226 Difference]: Without dead ends: 52 [2022-01-31 12:56:17,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=167, Invalid=584, Unknown=5, NotChecked=0, Total=756 [2022-01-31 12:56:17,894 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:56:17,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 77 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 114 Invalid, 0 Unknown, 53 Unchecked, 0.2s Time] [2022-01-31 12:56:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-31 12:56:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 45. [2022-01-31 12:56:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.7) internal successors, (68), 40 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:17,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 72 transitions. [2022-01-31 12:56:17,895 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 72 transitions. Word has length 19 [2022-01-31 12:56:17,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:56:17,896 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 72 transitions. [2022-01-31 12:56:17,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (36), 18 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 72 transitions. [2022-01-31 12:56:17,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:56:17,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:56:17,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:56:17,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-01-31 12:56:18,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:56:18,107 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:56:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:56:18,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1402005366, now seen corresponding path program 1 times [2022-01-31 12:56:18,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:56:18,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105369257] [2022-01-31 12:56:18,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:18,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:56:18,111 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-01-31 12:56:18,111 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:56:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:18,125 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:56:18,129 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.3))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:56:18,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:56:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:18,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:18,419 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:56:18,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105369257] [2022-01-31 12:56:18,420 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105369257] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:56:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469204799] [2022-01-31 12:56:18,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:18,420 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:56:18,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:56:18,421 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:56:18,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-01-31 12:56:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:18,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-31 12:56:18,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:56:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:19,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:56:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:32,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469204799] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:56:32,824 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:56:32,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 20 [2022-01-31 12:56:32,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022598998] [2022-01-31 12:56:32,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:56:32,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 12:56:32,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:56:32,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 12:56:32,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=299, Unknown=4, NotChecked=0, Total=380 [2022-01-31 12:56:32,826 INFO L87 Difference]: Start difference. First operand 45 states and 72 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:35,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:56:35,821 INFO L93 Difference]: Finished difference Result 69 states and 111 transitions. [2022-01-31 12:56:35,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 12:56:35,823 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:56:35,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:56:35,823 INFO L225 Difference]: With dead ends: 69 [2022-01-31 12:56:35,823 INFO L226 Difference]: Without dead ends: 65 [2022-01-31 12:56:35,823 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=172, Invalid=635, Unknown=5, NotChecked=0, Total=812 [2022-01-31 12:56:35,824 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 68 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:56:35,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 42 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 95 Invalid, 0 Unknown, 51 Unchecked, 0.2s Time] [2022-01-31 12:56:35,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-31 12:56:35,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 51. [2022-01-31 12:56:35,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2022-01-31 12:56:35,826 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 19 [2022-01-31 12:56:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:56:35,826 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2022-01-31 12:56:35,826 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 17 states have internal predecessors, (36), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:56:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2022-01-31 12:56:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:56:35,826 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:56:35,826 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:56:35,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-01-31 12:56:36,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-01-31 12:56:36,027 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:56:36,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:56:36,027 INFO L85 PathProgramCache]: Analyzing trace with hash -405199023, now seen corresponding path program 1 times [2022-01-31 12:56:36,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:56:36,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451715329] [2022-01-31 12:56:36,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:36,027 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:56:36,030 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-01-31 12:56:36,031 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-01-31 12:56:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:36,037 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:56:36,040 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.3))) (+ .cse0 main_~x~0_6 (* (- 4294967296) (div (+ .cse0 main_~x~0_6) 4294967296)))) 0)) [2022-01-31 12:56:36,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:56:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-31 12:56:36,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:56:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451715329] [2022-01-31 12:56:36,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451715329] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:56:36,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891438284] [2022-01-31 12:56:36,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:56:36,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:56:36,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:56:36,337 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:56:36,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-01-31 12:56:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:56:36,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-31 12:56:36,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:56:40,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:56:40,650 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 12:57:00,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:57:00,712 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891438284] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 12:57:00,712 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 12:57:00,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-01-31 12:57:00,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530546222] [2022-01-31 12:57:00,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 12:57:00,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 12:57:00,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 12:57:00,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 12:57:00,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=330, Unknown=5, NotChecked=0, Total=420 [2022-01-31 12:57:00,713 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:13,871 WARN L228 SmtUtils]: Spent 10.66s on a formula simplification. DAG size of input: 121 DAG size of output: 77 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:57:26,893 WARN L228 SmtUtils]: Spent 11.85s on a formula simplification. DAG size of input: 114 DAG size of output: 70 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:57:27,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 12:57:27,199 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2022-01-31 12:57:27,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 12:57:27,200 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-01-31 12:57:27,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 12:57:27,200 INFO L225 Difference]: With dead ends: 72 [2022-01-31 12:57:27,200 INFO L226 Difference]: Without dead ends: 68 [2022-01-31 12:57:27,201 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 9 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=259, Invalid=926, Unknown=5, NotChecked=0, Total=1190 [2022-01-31 12:57:27,201 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 84 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 12:57:27,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 52 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 89 Invalid, 0 Unknown, 84 Unchecked, 0.2s Time] [2022-01-31 12:57:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-31 12:57:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2022-01-31 12:57:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 46 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:27,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 83 transitions. [2022-01-31 12:57:27,203 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 83 transitions. Word has length 19 [2022-01-31 12:57:27,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 12:57:27,203 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 83 transitions. [2022-01-31 12:57:27,203 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.85) internal successors, (37), 18 states have internal predecessors, (37), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 12:57:27,203 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 83 transitions. [2022-01-31 12:57:27,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-31 12:57:27,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 12:57:27,203 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 12:57:27,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-01-31 12:57:27,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-01-31 12:57:27,415 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 12:57:27,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 12:57:27,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2144376817, now seen corresponding path program 1 times [2022-01-31 12:57:27,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-31 12:57:27,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464965251] [2022-01-31 12:57:27,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:27,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 12:57:27,418 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-01-31 12:57:27,419 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:57:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:27,426 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.4))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-01-31 12:57:27,429 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.5))) (+ main_~z~0_8 .cse0 (* (- 4294967296) (div (+ main_~z~0_8 .cse0) 4294967296)))) 0)) [2022-01-31 12:57:27,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 12:57:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:57:27,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-31 12:57:27,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464965251] [2022-01-31 12:57:27,799 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464965251] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-31 12:57:27,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212156701] [2022-01-31 12:57:27,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 12:57:27,799 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 12:57:27,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 12:57:27,800 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-31 12:57:27,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-01-31 12:57:27,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 12:57:27,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-31 12:57:27,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-31 12:58:48,814 WARN L228 SmtUtils]: Spent 1.03m on a formula simplification. DAG size of input: 55 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:59:21,655 WARN L228 SmtUtils]: Spent 16.37s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 12:59:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 12:59:44,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-31 13:00:32,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 13:00:32,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212156701] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-31 13:00:32,837 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-31 13:00:32,837 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 26 [2022-01-31 13:00:32,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197702224] [2022-01-31 13:00:32,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-31 13:00:32,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-31 13:00:32,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-31 13:00:32,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-31 13:00:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=474, Unknown=42, NotChecked=0, Total=650 [2022-01-31 13:00:32,847 INFO L87 Difference]: Start difference. First operand 51 states and 83 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 13:00:48,341 WARN L228 SmtUtils]: Spent 6.85s on a formula simplification. DAG size of input: 92 DAG size of output: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:01:36,054 WARN L228 SmtUtils]: Spent 29.48s on a formula simplification. DAG size of input: 85 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-31 13:02:37,449 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-01-31 13:02:37,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 13:02:37,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 245.7s TimeCoverageRelationStatistics Valid=224, Invalid=711, Unknown=57, NotChecked=0, Total=992 [2022-01-31 13:02:37,451 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 54 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 13:02:37,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 79 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2022-01-31 13:02:37,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-01-31 13:02:37,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-01-31 13:02:37,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-31 13:02:37,652 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.pushContext(SimplifyDDA.java:737) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walkParam(SimplifyDDA.java:526) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:412) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:868) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:784) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 57 more [2022-01-31 13:02:37,654 INFO L158 Benchmark]: Toolchain (without parser) took 566125.98ms. Allocated memory was 165.7MB in the beginning and 260.0MB in the end (delta: 94.4MB). Free memory was 116.5MB in the beginning and 206.2MB in the end (delta: -89.7MB). Peak memory consumption was 4.9MB. Max. memory is 8.0GB. [2022-01-31 13:02:37,654 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 132.9MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 13:02:37,654 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.21ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 116.2MB in the beginning and 192.2MB in the end (delta: -76.0MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-01-31 13:02:37,655 INFO L158 Benchmark]: Boogie Preprocessor took 45.71ms. Allocated memory is still 216.0MB. Free memory was 192.2MB in the beginning and 190.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 13:02:37,655 INFO L158 Benchmark]: RCFGBuilder took 289.36ms. Allocated memory is still 216.0MB. Free memory was 190.6MB in the beginning and 178.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-01-31 13:02:37,655 INFO L158 Benchmark]: IcfgTransformer took 562.26ms. Allocated memory is still 216.0MB. Free memory was 178.6MB in the beginning and 147.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2022-01-31 13:02:37,655 INFO L158 Benchmark]: TraceAbstraction took 565080.76ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 147.1MB in the beginning and 206.2MB in the end (delta: -59.1MB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 13:02:37,656 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult - StatisticsResult: Jordan loop acceleration statistics 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 165.7MB. Free memory was 133.1MB in the beginning and 132.9MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 144.21ms. Allocated memory was 165.7MB in the beginning and 216.0MB in the end (delta: 50.3MB). Free memory was 116.2MB in the beginning and 192.2MB in the end (delta: -76.0MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.71ms. Allocated memory is still 216.0MB. Free memory was 192.2MB in the beginning and 190.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 289.36ms. Allocated memory is still 216.0MB. Free memory was 190.6MB in the beginning and 178.6MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 562.26ms. Allocated memory is still 216.0MB. Free memory was 178.6MB in the beginning and 147.6MB in the end (delta: 30.9MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 565080.76ms. Allocated memory was 216.0MB in the beginning and 260.0MB in the end (delta: 44.0MB). Free memory was 147.1MB in the beginning and 206.2MB in the end (delta: -59.1MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...