/usr/bin/java -ea -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/loop-zilu/benchmark26_linear.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 17:58:34,776 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 17:58:34,778 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 17:58:34,820 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 17:58:34,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 17:58:34,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 17:58:34,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 17:58:34,827 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 17:58:34,829 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 17:58:34,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 17:58:34,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 17:58:34,836 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 17:58:34,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 17:58:34,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 17:58:34,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 17:58:34,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 17:58:34,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 17:58:34,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 17:58:34,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 17:58:34,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 17:58:34,853 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 17:58:34,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 17:58:34,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 17:58:34,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 17:58:34,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 17:58:34,861 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 17:58:34,861 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 17:58:34,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 17:58:34,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 17:58:34,862 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 17:58:34,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 17:58:34,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 17:58:34,866 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 17:58:34,867 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 17:58:34,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 17:58:34,868 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 17:58:34,868 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 17:58:34,869 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 17:58:34,869 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 17:58:34,869 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 17:58:34,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 17:58:34,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 17:58:34,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 17:58:34,884 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 17:58:34,884 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 17:58:34,885 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 17:58:34,885 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 17:58:34,886 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 17:58:34,886 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 17:58:34,886 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 17:58:34,886 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 17:58:34,886 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 17:58:34,887 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 17:58:34,887 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 17:58:34,887 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 17:58:34,887 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 17:58:34,887 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 17:58:34,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 17:58:34,888 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 17:58:34,888 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 17:58:34,888 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 17:58:34,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:58:34,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 17:58:34,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 17:58:34,889 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 17:58:34,889 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-04-07 17:58:35,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 17:58:35,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 17:58:35,172 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 17:58:35,172 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 17:58:35,173 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 17:58:35,174 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-07 17:58:35,235 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7167d68/7a6a0d15f35d48e5827cb4d08dabe24b/FLAG99df0e602 [2022-04-07 17:58:35,565 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 17:58:35,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i [2022-04-07 17:58:35,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7167d68/7a6a0d15f35d48e5827cb4d08dabe24b/FLAG99df0e602 [2022-04-07 17:58:35,999 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c7167d68/7a6a0d15f35d48e5827cb4d08dabe24b [2022-04-07 17:58:36,002 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 17:58:36,003 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 17:58:36,007 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 17:58:36,007 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 17:58:36,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 17:58:36,012 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e965c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36, skipping insertion in model container [2022-04-07 17:58:36,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 17:58:36,030 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 17:58:36,152 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i[868,881] [2022-04-07 17:58:36,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:58:36,173 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 17:58:36,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark26_linear.i[868,881] [2022-04-07 17:58:36,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 17:58:36,215 INFO L208 MainTranslator]: Completed translation [2022-04-07 17:58:36,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36 WrapperNode [2022-04-07 17:58:36,216 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 17:58:36,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 17:58:36,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 17:58:36,218 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 17:58:36,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 17:58:36,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 17:58:36,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 17:58:36,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 17:58:36,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 17:58:36,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:58:36,287 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-04-07 17:58:36,289 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-04-07 17:58:36,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 17:58:36,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 17:58:36,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 17:58:36,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 17:58:36,316 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 17:58:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 17:58:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-07 17:58:36,316 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-07 17:58:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 17:58:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 17:58:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 17:58:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2022-04-07 17:58:36,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 17:58:36,318 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 17:58:36,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 17:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 17:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 17:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 17:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 17:58:36,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 17:58:36,375 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 17:58:36,376 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 17:58:36,460 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 17:58:36,466 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 17:58:36,466 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-07 17:58:36,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:58:36 BoogieIcfgContainer [2022-04-07 17:58:36,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 17:58:36,468 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 17:58:36,468 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 17:58:36,469 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 17:58:36,472 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:58:36" (1/1) ... [2022-04-07 17:58:36,474 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 17:58:40,694 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-07 17:58:40,848 INFO L89 elerationTransformer]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-07 17:58:40,848 INFO L91 elerationTransformer]: Accelerated Formula: (and (= (+ v_main_~x~0_3 1) v_main_~x~0_2) (< v_main_~x~0_3 v_main_~y~0_2)) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] to Formula: (or (and (< v_main_~x~0_2 (+ v_main_~y~0_2 1)) (< v_main_~x~0_3 v_main_~x~0_2)) (and (= v_main_~x~0_3 v_main_~x~0_2) (not (< v_main_~x~0_3 v_main_~y~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] [2022-04-07 17:58:40,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:58:40 BasicIcfg [2022-04-07 17:58:40,854 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 17:58:40,855 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 17:58:40,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 17:58:40,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 17:58:40,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 05:58:36" (1/4) ... [2022-04-07 17:58:40,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456dac4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:58:40, skipping insertion in model container [2022-04-07 17:58:40,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 05:58:36" (2/4) ... [2022-04-07 17:58:40,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456dac4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 05:58:40, skipping insertion in model container [2022-04-07 17:58:40,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 05:58:36" (3/4) ... [2022-04-07 17:58:40,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@456dac4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:58:40, skipping insertion in model container [2022-04-07 17:58:40,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 05:58:40" (4/4) ... [2022-04-07 17:58:40,861 INFO L111 eAbstractionObserver]: Analyzing ICFG benchmark26_linear.iJordan [2022-04-07 17:58:40,866 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 17:58:40,866 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 17:58:40,898 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 17:58:40,903 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 17:58:40,903 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 17:58:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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-04-07 17:58:40,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:58:40,923 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:58:40,923 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:58:40,924 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:58:40,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:58:40,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1809217115, now seen corresponding path program 1 times [2022-04-07 17:58:40,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:58:40,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707680265] [2022-04-07 17:58:40,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:58:40,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:58:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:58:41,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 17:58:41,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:58:41,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:58:41,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:58:41,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {23#true} is VALID [2022-04-07 17:58:41,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:58:41,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:58:41,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:58:41,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {23#true} is VALID [2022-04-07 17:58:41,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {23#true} is VALID [2022-04-07 17:58:41,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#true} [57] L23-2-->L23-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:58:41,098 INFO L272 TraceCheckUtils]: 8: Hoare triple {24#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {24#false} is VALID [2022-04-07 17:58:41,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {24#false} is VALID [2022-04-07 17:58:41,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:58:41,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {24#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24#false} is VALID [2022-04-07 17:58:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:58:41,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:58:41,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707680265] [2022-04-07 17:58:41,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707680265] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:58:41,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:58:41,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 17:58:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397613725] [2022-04-07 17:58:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:58:41,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-07 17:58:41,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:58:41,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-07 17:58:41,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:58:41,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 17:58:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:58:41,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 17:58:41,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:58:41,181 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 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 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-07 17:58:41,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:41,240 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-07 17:58:41,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 17:58:41,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-07 17:58:41,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:58:41,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-07 17:58:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 17:58:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-07 17:58:41,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2022-04-07 17:58:41,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 23 transitions. [2022-04-07 17:58:41,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:58:41,294 INFO L225 Difference]: With dead ends: 20 [2022-04-07 17:58:41,295 INFO L226 Difference]: Without dead ends: 13 [2022-04-07 17:58:41,297 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 17:58:41,300 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 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-04-07 17:58:41,301 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:58:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-07 17:58:41,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-07 17:58:41,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:58:41,320 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-07 17:58:41,321 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-07 17:58:41,321 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-07 17:58:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:41,323 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 17:58:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 17:58:41,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:58:41,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:58:41,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-07 17:58:41,325 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) Second operand 13 states. [2022-04-07 17:58:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:41,327 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-07 17:58:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 17:58:41,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:58:41,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:58:41,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:58:41,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:58:41,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-04-07 17:58:41,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-07 17:58:41,330 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 12 [2022-04-07 17:58:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:58:41,330 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-07 17:58:41,331 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-04-07 17:58:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-07 17:58:41,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-07 17:58:41,331 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:58:41,332 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:58:41,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 17:58:41,332 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:58:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:58:41,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1810140636, now seen corresponding path program 1 times [2022-04-07 17:58:41,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:58:41,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853137578] [2022-04-07 17:58:41,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:58:41,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:58:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:58:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,384 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {90#true} is VALID [2022-04-07 17:58:41,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:58:41,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:58:41,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {90#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:58:41,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {90#true} is VALID [2022-04-07 17:58:41,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {90#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:58:41,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90#true} {90#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:58:41,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {90#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {90#true} is VALID [2022-04-07 17:58:41,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {90#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {90#true} is VALID [2022-04-07 17:58:41,387 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {95#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-07 17:58:41,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {95#(<= (+ main_~x~0 1) main_~y~0)} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-07 17:58:41,388 INFO L272 TraceCheckUtils]: 8: Hoare triple {91#false} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {91#false} is VALID [2022-04-07 17:58:41,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {91#false} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {91#false} is VALID [2022-04-07 17:58:41,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {91#false} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-07 17:58:41,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {91#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {91#false} is VALID [2022-04-07 17:58:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:58:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:58:41,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853137578] [2022-04-07 17:58:41,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853137578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 17:58:41,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 17:58:41,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 17:58:41,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368420735] [2022-04-07 17:58:41,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:58:41,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-07 17:58:41,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:58:41,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-07 17:58:41,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:58:41,403 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 17:58:41,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:58:41,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 17:58:41,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 17:58:41,404 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-07 17:58:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:41,451 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 17:58:41,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 17:58:41,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 12 [2022-04-07 17:58:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:58:41,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-07 17:58:41,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-07 17:58:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-07 17:58:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-04-07 17:58:41,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 15 transitions. [2022-04-07 17:58:41,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:58:41,470 INFO L225 Difference]: With dead ends: 14 [2022-04-07 17:58:41,470 INFO L226 Difference]: Without dead ends: 14 [2022-04-07 17:58:41,470 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-07 17:58:41,472 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:58:41,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:58:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-07 17:58:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-07 17:58:41,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:58:41,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-07 17:58:41,496 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-07 17:58:41,496 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-07 17:58:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:41,498 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 17:58:41,498 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 17:58:41,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:58:41,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:58:41,498 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) Second operand 14 states. [2022-04-07 17:58:41,499 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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) Second operand 14 states. [2022-04-07 17:58:41,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:41,500 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-07 17:58:41,500 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 17:58:41,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:58:41,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:58:41,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:58:41,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:58:41,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-04-07 17:58:41,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-07 17:58:41,502 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-07 17:58:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:58:41,502 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-07 17:58:41,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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-04-07 17:58:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-07 17:58:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-07 17:58:41,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 17:58:41,503 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 17:58:41,504 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-07 17:58:41,504 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 17:58:41,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 17:58:41,505 INFO L85 PathProgramCache]: Analyzing trace with hash 306506437, now seen corresponding path program 1 times [2022-04-07 17:58:41,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 17:58:41,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282914375] [2022-04-07 17:58:41,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:58:41,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 17:58:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 17:58:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {157#true} is VALID [2022-04-07 17:58:41,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,622 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,623 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 17:58:41,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {157#true} is VALID [2022-04-07 17:58:41,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {157#true} is VALID [2022-04-07 17:58:41,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {162#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-07 17:58:41,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(<= (+ main_~x~0 1) main_~y~0)} [59] L23-2-->L23-2: Formula: (or (and (< v_main_~x~0_2 (+ v_main_~y~0_2 1)) (< v_main_~x~0_3 v_main_~x~0_2)) (and (= v_main_~x~0_3 v_main_~x~0_2) (not (< v_main_~x~0_3 v_main_~y~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] {163#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 17:58:41,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(< main_~x~0 (+ main_~y~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {164#(= main_~y~0 main_~x~0)} is VALID [2022-04-07 17:58:41,627 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(= main_~y~0 main_~x~0)} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {165#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 17:58:41,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {165#(not (= |__VERIFIER_assert_#in~cond| 0))} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {166#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 17:58:41,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {166#(not (= __VERIFIER_assert_~cond 0))} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 17:58:41,629 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 17:58:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:58:41,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 17:58:41,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282914375] [2022-04-07 17:58:41,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282914375] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 17:58:41,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881145887] [2022-04-07 17:58:41,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 17:58:41,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:58:41,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 17:58:41,632 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-04-07 17:58:41,667 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-04-07 17:58:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-07 17:58:41,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 17:58:41,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 17:58:41,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {157#true} is VALID [2022-04-07 17:58:41,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:41,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {157#true} is VALID [2022-04-07 17:58:41,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {162#(<= (+ main_~x~0 1) main_~y~0)} is VALID [2022-04-07 17:58:41,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {162#(<= (+ main_~x~0 1) main_~y~0)} [59] L23-2-->L23-2: Formula: (or (and (< v_main_~x~0_2 (+ v_main_~y~0_2 1)) (< v_main_~x~0_3 v_main_~x~0_2)) (and (= v_main_~x~0_3 v_main_~x~0_2) (not (< v_main_~x~0_3 v_main_~y~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] {163#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 17:58:41,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(< main_~x~0 (+ main_~y~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {164#(= main_~y~0 main_~x~0)} is VALID [2022-04-07 17:58:41,944 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(= main_~y~0 main_~x~0)} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:58:41,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:58:41,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 17:58:41,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 17:58:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 17:58:41,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 17:58:42,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {158#false} [65] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 17:58:42,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#(<= 1 __VERIFIER_assert_~cond)} [63] L15-->L16: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {158#false} is VALID [2022-04-07 17:58:42,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {198#(<= 1 |__VERIFIER_assert_#in~cond|)} [62] __VERIFIER_assertENTRY-->L15: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {202#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 17:58:42,077 INFO L272 TraceCheckUtils]: 9: Hoare triple {164#(= main_~y~0 main_~x~0)} [60] L23-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~x~0_8 v_main_~y~0_7) 1 0)) InVars {main_~x~0=v_main_~x~0_8, main_~y~0=v_main_~y~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0] {198#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 17:58:42,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#(< main_~x~0 (+ main_~y~0 1))} [58] L23-2-->L23-3: Formula: (not (< v_main_~x~0_1 v_main_~y~0_1)) InVars {main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} OutVars{main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1} AuxVars[] AssignedVars[] {164#(= main_~y~0 main_~x~0)} is VALID [2022-04-07 17:58:42,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {163#(< main_~x~0 (+ main_~y~0 1))} [59] L23-2-->L23-2: Formula: (or (and (< v_main_~x~0_2 (+ v_main_~y~0_2 1)) (< v_main_~x~0_3 v_main_~x~0_2)) (and (= v_main_~x~0_3 v_main_~x~0_2) (not (< v_main_~x~0_3 v_main_~y~0_2)))) InVars {main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_2} OutVars{main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~x~0] {163#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 17:58:42,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {157#true} [55] L22-->L23-2: Formula: (< v_main_~x~0_7 v_main_~y~0_6) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} OutVars{main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_6} AuxVars[] AssignedVars[] {163#(< main_~x~0 (+ main_~y~0 1))} is VALID [2022-04-07 17:58:42,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#true} [52] mainENTRY-->L22: Formula: (and (<= |v_main_#t~nondet1_2| 2147483647) (= v_main_~y~0_3 |v_main_#t~nondet2_2|) (= v_main_~x~0_4 |v_main_#t~nondet1_2|) (<= 0 (+ |v_main_#t~nondet2_2| 2147483648)) (<= |v_main_#t~nondet2_2| 2147483647) (<= 0 (+ |v_main_#t~nondet1_2| 2147483648))) InVars {main_#t~nondet1=|v_main_#t~nondet1_2|, main_#t~nondet2=|v_main_#t~nondet2_2|} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_3} AuxVars[] AssignedVars[main_~x~0, main_#t~nondet1, main_#t~nondet2, main_~y~0] {157#true} is VALID [2022-04-07 17:58:42,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {157#true} [49] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:42,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {157#true} {157#true} [68] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:42,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#true} [53] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:42,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {157#true} [50] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= (select |v_#length_1| 2) 21) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {157#true} is VALID [2022-04-07 17:58:42,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {157#true} [48] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {157#true} is VALID [2022-04-07 17:58:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 17:58:42,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881145887] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 17:58:42,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-07 17:58:42,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 10 [2022-04-07 17:58:42,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349159198] [2022-04-07 17:58:42,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 17:58:42,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-07 17:58:42,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 17:58:42,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-04-07 17:58:42,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:58:42,098 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 17:58:42,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 17:58:42,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 17:58:42,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 17:58:42,099 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-04-07 17:58:42,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:42,159 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-07 17:58:42,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 17:58:42,159 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 13 [2022-04-07 17:58:42,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 17:58:42,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-04-07 17:58:42,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-07 17:58:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-04-07 17:58:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 12 transitions. [2022-04-07 17:58:42,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 12 transitions. [2022-04-07 17:58:42,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 17:58:42,173 INFO L225 Difference]: With dead ends: 12 [2022-04-07 17:58:42,173 INFO L226 Difference]: Without dead ends: 0 [2022-04-07 17:58:42,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-07 17:58:42,174 INFO L913 BasicCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 17:58:42,175 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 32 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 17:58:42,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-07 17:58:42,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-07 17:58:42,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 17:58:42,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:58:42,176 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:58:42,176 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:58:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:42,176 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:58:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:58:42,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:58:42,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:58:42,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:58:42,177 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-07 17:58:42,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 17:58:42,177 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-07 17:58:42,177 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:58:42,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:58:42,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 17:58:42,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 17:58:42,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 17:58:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-07 17:58:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-07 17:58:42,178 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-04-07 17:58:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 17:58:42,178 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-07 17:58:42,179 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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-04-07 17:58:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-07 17:58:42,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 17:58:42,181 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 17:58:42,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 17:58:42,391 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 17:58:42,393 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-07 17:58:42,394 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 17:58:42,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 05:58:42 BasicIcfg [2022-04-07 17:58:42,397 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 17:58:42,398 INFO L158 Benchmark]: Toolchain (without parser) took 6394.83ms. Allocated memory was 183.5MB in the beginning and 237.0MB in the end (delta: 53.5MB). Free memory was 128.2MB in the beginning and 167.7MB in the end (delta: -39.5MB). Peak memory consumption was 14.1MB. Max. memory is 8.0GB. [2022-04-07 17:58:42,398 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 17:58:42,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.69ms. Allocated memory is still 183.5MB. Free memory was 128.0MB in the beginning and 154.9MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-07 17:58:42,399 INFO L158 Benchmark]: Boogie Preprocessor took 36.04ms. Allocated memory is still 183.5MB. Free memory was 154.9MB in the beginning and 153.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 17:58:42,399 INFO L158 Benchmark]: RCFGBuilder took 213.83ms. Allocated memory is still 183.5MB. Free memory was 153.2MB in the beginning and 143.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-07 17:58:42,400 INFO L158 Benchmark]: IcfgTransformer took 4385.71ms. Allocated memory is still 183.5MB. Free memory was 143.1MB in the beginning and 128.7MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-07 17:58:42,400 INFO L158 Benchmark]: TraceAbstraction took 1541.47ms. Allocated memory was 183.5MB in the beginning and 237.0MB in the end (delta: 53.5MB). Free memory was 128.3MB in the beginning and 167.7MB in the end (delta: -39.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. [2022-04-07 17:58:42,402 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from IcfgTransformer: - StatisticsResult: Jordan loop acceleration statistics 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 183.5MB. Free memory is still 144.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 209.69ms. Allocated memory is still 183.5MB. Free memory was 128.0MB in the beginning and 154.9MB in the end (delta: -26.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.04ms. Allocated memory is still 183.5MB. Free memory was 154.9MB in the beginning and 153.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 213.83ms. Allocated memory is still 183.5MB. Free memory was 153.2MB in the beginning and 143.1MB in the end (delta: 10.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * IcfgTransformer took 4385.71ms. Allocated memory is still 183.5MB. Free memory was 143.1MB in the beginning and 128.7MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 1541.47ms. Allocated memory was 183.5MB in the beginning and 237.0MB in the end (delta: 53.5MB). Free memory was 128.3MB in the beginning and 167.7MB in the end (delta: -39.4MB). Peak memory consumption was 14.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 40 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 58 ConstructedInterpolants, 0 QuantifiedInterpolants, 124 SizeOfPredicates, 1 NumberOfNonLiveVariables, 55 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-07 17:58:42,422 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 0 Received shutdown request...