/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:20:02,926 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:20:03,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:20:03,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:20:03,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:20:03,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:20:03,048 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:20:03,048 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:20:03,049 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:20:03,052 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:20:03,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:20:03,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:20:03,053 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:20:03,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:20:03,055 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:20:03,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:20:03,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:20:03,055 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:20:03,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:20:03,057 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:20:03,057 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:20:03,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:20:03,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:20:03,058 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:20:03,058 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:20:03,058 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:20:03,058 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:20:03,058 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:20:03,059 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:20:03,059 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:20:03,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:20:03,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:20:03,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:20:03,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:20:03,060 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:20:03,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:20:03,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:20:03,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:20:03,061 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:20:03,061 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:20:03,061 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:20:03,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:20:03,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:20:03,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 04:20:03,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:20:03,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:20:03,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:20:03,309 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:20:03,309 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:20:03,310 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i [2023-12-16 04:20:04,554 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:20:04,764 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:20:04,765 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i [2023-12-16 04:20:04,772 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7e7fdb8/95b2187af5c9458c859b54d9de760749/FLAG8850b0070 [2023-12-16 04:20:04,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f7e7fdb8/95b2187af5c9458c859b54d9de760749 [2023-12-16 04:20:04,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:20:04,787 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:20:04,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:20:04,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:20:04,798 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:20:04,799 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:04" (1/1) ... [2023-12-16 04:20:04,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d7c9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:04, skipping insertion in model container [2023-12-16 04:20:04,800 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:20:04" (1/1) ... [2023-12-16 04:20:04,835 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:20:04,982 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i[916,929] [2023-12-16 04:20:05,039 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:20:05,053 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:20:05,062 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i[916,929] [2023-12-16 04:20:05,118 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:20:05,140 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:20:05,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05 WrapperNode [2023-12-16 04:20:05,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:20:05,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:20:05,143 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:20:05,143 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:20:05,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,194 INFO L138 Inliner]: procedures = 29, calls = 131, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 405 [2023-12-16 04:20:05,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:20:05,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:20:05,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:20:05,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:20:05,206 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,211 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,244 INFO L175 MemorySlicer]: Split 103 memory accesses to 7 slices as follows [2, 13, 18, 8, 45, 11, 6]. 44 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 2, 2, 1, 4, 1, 1]. The 15 writes are split as follows [0, 2, 2, 1, 5, 3, 2]. [2023-12-16 04:20:05,244 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,244 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,274 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:20:05,275 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:20:05,275 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:20:05,275 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:20:05,276 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (1/1) ... [2023-12-16 04:20:05,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:20:05,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:05,318 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:20:05,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:20:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:20:05,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:20:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:20:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-16 04:20:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-16 04:20:05,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-16 04:20:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-16 04:20:05,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-16 04:20:05,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:20:05,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:20:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-16 04:20:05,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-16 04:20:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-16 04:20:05,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-16 04:20:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-16 04:20:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:20:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:20:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-16 04:20:05,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:20:05,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-16 04:20:05,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-16 04:20:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-16 04:20:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-16 04:20:05,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:20:05,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:20:05,512 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:20:05,513 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:20:05,890 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:20:05,936 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:20:05,937 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:20:05,937 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:05 BoogieIcfgContainer [2023-12-16 04:20:05,937 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:20:05,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:20:05,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:20:05,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:20:05,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:20:04" (1/3) ... [2023-12-16 04:20:05,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f639e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:05, skipping insertion in model container [2023-12-16 04:20:05,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:20:05" (2/3) ... [2023-12-16 04:20:05,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f639e7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:20:05, skipping insertion in model container [2023-12-16 04:20:05,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:20:05" (3/3) ... [2023-12-16 04:20:05,945 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-79.i [2023-12-16 04:20:05,961 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:20:05,961 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:20:06,011 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:20:06,016 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@283eda2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:20:06,016 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:20:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:20:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:20:06,037 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:06,038 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:06,038 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:06,043 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:06,043 INFO L85 PathProgramCache]: Analyzing trace with hash 158505908, now seen corresponding path program 1 times [2023-12-16 04:20:06,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:06,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014765443] [2023-12-16 04:20:06,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:06,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:06,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:06,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014765443] [2023-12-16 04:20:06,293 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:20:06,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438257705] [2023-12-16 04:20:06,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:06,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:06,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:06,298 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) [2023-12-16 04:20:06,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 04:20:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:06,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 04:20:06,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2023-12-16 04:20:06,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:06,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438257705] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:06,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:06,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:20:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584679993] [2023-12-16 04:20:06,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:06,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:20:06,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:06,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:20:06,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:20:06,633 INFO L87 Difference]: Start difference. First operand has 84 states, 70 states have (on average 1.4714285714285715) internal successors, (103), 71 states have internal predecessors, (103), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 04:20:06,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:06,679 INFO L93 Difference]: Finished difference Result 165 states and 259 transitions. [2023-12-16 04:20:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:20:06,681 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2023-12-16 04:20:06,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:06,688 INFO L225 Difference]: With dead ends: 165 [2023-12-16 04:20:06,689 INFO L226 Difference]: Without dead ends: 82 [2023-12-16 04:20:06,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:20:06,697 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:06,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:06,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-16 04:20:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-12-16 04:20:06,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.4202898550724639) internal successors, (98), 69 states have internal predecessors, (98), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:20:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-12-16 04:20:06,749 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 95 [2023-12-16 04:20:06,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:06,749 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-12-16 04:20:06,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 04:20:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-12-16 04:20:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:20:06,756 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:06,757 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:06,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:06,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 04:20:06,963 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:06,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1089816234, now seen corresponding path program 1 times [2023-12-16 04:20:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:06,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991279205] [2023-12-16 04:20:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991279205] [2023-12-16 04:20:07,078 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-16 04:20:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446270947] [2023-12-16 04:20:07,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:07,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:07,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:07,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:07,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 04:20:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:07,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:20:07,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:07,319 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-16 04:20:07,319 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:07,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446270947] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:07,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:07,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:20:07,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060389339] [2023-12-16 04:20:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:07,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:20:07,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:07,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:20:07,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:20:07,328 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 04:20:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:07,393 INFO L93 Difference]: Finished difference Result 169 states and 248 transitions. [2023-12-16 04:20:07,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:20:07,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 95 [2023-12-16 04:20:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:07,395 INFO L225 Difference]: With dead ends: 169 [2023-12-16 04:20:07,395 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 04:20:07,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:07,400 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 10 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:07,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 340 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:07,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 04:20:07,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2023-12-16 04:20:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.408450704225352) internal successors, (100), 71 states have internal predecessors, (100), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:20:07,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 122 transitions. [2023-12-16 04:20:07,420 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 122 transitions. Word has length 95 [2023-12-16 04:20:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:07,420 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 122 transitions. [2023-12-16 04:20:07,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-16 04:20:07,420 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 122 transitions. [2023-12-16 04:20:07,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:20:07,422 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:07,422 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:07,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:07,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 04:20:07,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:07,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:07,623 INFO L85 PathProgramCache]: Analyzing trace with hash -2147312984, now seen corresponding path program 1 times [2023-12-16 04:20:07,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:07,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903150902] [2023-12-16 04:20:07,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:07,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:07,676 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:07,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1172409420] [2023-12-16 04:20:07,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:07,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:07,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:07,678 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:07,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-16 04:20:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:07,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:20:07,914 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:07,940 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:07,940 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:07,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:07,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903150902] [2023-12-16 04:20:07,942 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:07,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172409420] [2023-12-16 04:20:07,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172409420] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:07,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:07,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:20:07,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332217026] [2023-12-16 04:20:07,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:07,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:20:07,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:07,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:20:07,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:20:07,945 INFO L87 Difference]: Start difference. First operand 84 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:07,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:07,995 INFO L93 Difference]: Finished difference Result 171 states and 248 transitions. [2023-12-16 04:20:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:20:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2023-12-16 04:20:07,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:08,000 INFO L225 Difference]: With dead ends: 171 [2023-12-16 04:20:08,000 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 04:20:08,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:08,004 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:08,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 336 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:08,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 04:20:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2023-12-16 04:20:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 73 states have internal predecessors, (102), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:20:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 124 transitions. [2023-12-16 04:20:08,020 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 124 transitions. Word has length 95 [2023-12-16 04:20:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:08,020 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 124 transitions. [2023-12-16 04:20:08,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 124 transitions. [2023-12-16 04:20:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-16 04:20:08,022 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:08,022 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:08,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:08,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:08,234 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:08,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:08,235 INFO L85 PathProgramCache]: Analyzing trace with hash -2147253402, now seen corresponding path program 1 times [2023-12-16 04:20:08,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:08,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599849351] [2023-12-16 04:20:08,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:08,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:08,280 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:08,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2110092059] [2023-12-16 04:20:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:08,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:08,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:08,286 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:08,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-16 04:20:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:08,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 04:20:08,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:08,477 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:08,477 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:08,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:08,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599849351] [2023-12-16 04:20:08,478 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:08,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110092059] [2023-12-16 04:20:08,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110092059] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:08,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:08,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:20:08,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702350875] [2023-12-16 04:20:08,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:08,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:20:08,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:20:08,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:20:08,480 INFO L87 Difference]: Start difference. First operand 86 states and 124 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:08,509 INFO L93 Difference]: Finished difference Result 190 states and 274 transitions. [2023-12-16 04:20:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:20:08,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2023-12-16 04:20:08,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:08,513 INFO L225 Difference]: With dead ends: 190 [2023-12-16 04:20:08,513 INFO L226 Difference]: Without dead ends: 105 [2023-12-16 04:20:08,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:08,520 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 40 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:08,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 351 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-16 04:20:08,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2023-12-16 04:20:08,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:20:08,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2023-12-16 04:20:08,531 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 95 [2023-12-16 04:20:08,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:08,532 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2023-12-16 04:20:08,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:08,532 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2023-12-16 04:20:08,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-12-16 04:20:08,533 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:08,534 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:08,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:08,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:08,736 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:08,736 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:08,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1787207221, now seen corresponding path program 1 times [2023-12-16 04:20:08,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:08,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186099745] [2023-12-16 04:20:08,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:08,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:08,780 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:08,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1939302542] [2023-12-16 04:20:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:08,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:08,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:08,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:08,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-16 04:20:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:08,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 04:20:08,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:09,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 04:20:09,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:09,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2023-12-16 04:20:09,067 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:09,068 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:09,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186099745] [2023-12-16 04:20:09,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:09,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939302542] [2023-12-16 04:20:09,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939302542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:09,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:09,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:09,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431268760] [2023-12-16 04:20:09,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:09,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:09,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:09,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:09,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:09,070 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:09,135 INFO L93 Difference]: Finished difference Result 218 states and 309 transitions. [2023-12-16 04:20:09,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:09,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 97 [2023-12-16 04:20:09,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:09,139 INFO L225 Difference]: With dead ends: 218 [2023-12-16 04:20:09,139 INFO L226 Difference]: Without dead ends: 131 [2023-12-16 04:20:09,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:09,140 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:09,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 485 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:09,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-12-16 04:20:09,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 90. [2023-12-16 04:20:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-16 04:20:09,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 128 transitions. [2023-12-16 04:20:09,157 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 128 transitions. Word has length 97 [2023-12-16 04:20:09,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:09,157 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 128 transitions. [2023-12-16 04:20:09,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 128 transitions. [2023-12-16 04:20:09,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-16 04:20:09,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:09,164 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:09,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:09,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:09,371 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:09,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:09,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1836147126, now seen corresponding path program 1 times [2023-12-16 04:20:09,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:09,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580822539] [2023-12-16 04:20:09,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:09,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:09,402 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:09,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [626887109] [2023-12-16 04:20:09,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:09,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:09,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:09,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:09,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-16 04:20:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:09,597 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 04:20:09,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:09,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2023-12-16 04:20:09,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:09,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 223 treesize of output 143 [2023-12-16 04:20:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-16 04:20:09,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:20:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:10,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580822539] [2023-12-16 04:20:10,113 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626887109] [2023-12-16 04:20:10,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626887109] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-16 04:20:10,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-16 04:20:10,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-16 04:20:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278777347] [2023-12-16 04:20:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:10,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:10,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:20:10,115 INFO L87 Difference]: Start difference. First operand 90 states and 128 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:10,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:10,419 INFO L93 Difference]: Finished difference Result 304 states and 430 transitions. [2023-12-16 04:20:10,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:20:10,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 98 [2023-12-16 04:20:10,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:10,421 INFO L225 Difference]: With dead ends: 304 [2023-12-16 04:20:10,421 INFO L226 Difference]: Without dead ends: 215 [2023-12-16 04:20:10,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:20:10,422 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 172 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:10,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 798 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:20:10,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-12-16 04:20:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 159. [2023-12-16 04:20:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 136 states have (on average 1.3676470588235294) internal successors, (186), 137 states have internal predecessors, (186), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 04:20:10,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 226 transitions. [2023-12-16 04:20:10,433 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 226 transitions. Word has length 98 [2023-12-16 04:20:10,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:10,436 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 226 transitions. [2023-12-16 04:20:10,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 226 transitions. [2023-12-16 04:20:10,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 04:20:10,438 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:10,439 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:10,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:10,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:10,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:10,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1851202519, now seen corresponding path program 1 times [2023-12-16 04:20:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:10,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916347636] [2023-12-16 04:20:10,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:10,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:10,673 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:10,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2063471792] [2023-12-16 04:20:10,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:10,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:10,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:10,675 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:10,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-16 04:20:10,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:10,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 04:20:10,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:10,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-12-16 04:20:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:10,930 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:10,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916347636] [2023-12-16 04:20:10,931 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:10,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063471792] [2023-12-16 04:20:10,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063471792] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:10,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:10,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:20:10,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521976306] [2023-12-16 04:20:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:10,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:20:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:10,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:20:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:20:10,933 INFO L87 Difference]: Start difference. First operand 159 states and 226 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:11,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:11,079 INFO L93 Difference]: Finished difference Result 447 states and 631 transitions. [2023-12-16 04:20:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:20:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-16 04:20:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:11,082 INFO L225 Difference]: With dead ends: 447 [2023-12-16 04:20:11,083 INFO L226 Difference]: Without dead ends: 289 [2023-12-16 04:20:11,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:20:11,084 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 98 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:11,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 375 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-12-16 04:20:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 195. [2023-12-16 04:20:11,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 172 states have (on average 1.377906976744186) internal successors, (237), 173 states have internal predecessors, (237), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-16 04:20:11,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 277 transitions. [2023-12-16 04:20:11,100 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 277 transitions. Word has length 99 [2023-12-16 04:20:11,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:11,101 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 277 transitions. [2023-12-16 04:20:11,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:11,101 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 277 transitions. [2023-12-16 04:20:11,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-16 04:20:11,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:11,103 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:11,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:11,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:11,310 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:11,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1742700199, now seen corresponding path program 1 times [2023-12-16 04:20:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715826149] [2023-12-16 04:20:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:11,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:11,339 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388168263] [2023-12-16 04:20:11,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:11,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:11,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:11,341 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:11,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-16 04:20:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:11,526 INFO L262 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-16 04:20:11,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:11,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-12-16 04:20:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:11,582 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:11,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715826149] [2023-12-16 04:20:11,583 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388168263] [2023-12-16 04:20:11,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388168263] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:11,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:11,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682562858] [2023-12-16 04:20:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:11,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:11,585 INFO L87 Difference]: Start difference. First operand 195 states and 277 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:11,760 INFO L93 Difference]: Finished difference Result 577 states and 816 transitions. [2023-12-16 04:20:11,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:20:11,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 99 [2023-12-16 04:20:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:11,763 INFO L225 Difference]: With dead ends: 577 [2023-12-16 04:20:11,763 INFO L226 Difference]: Without dead ends: 383 [2023-12-16 04:20:11,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:20:11,764 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 141 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:11,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 656 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:11,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2023-12-16 04:20:11,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 365. [2023-12-16 04:20:11,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 330 states have (on average 1.378787878787879) internal successors, (455), 333 states have internal predecessors, (455), 30 states have call successors, (30), 4 states have call predecessors, (30), 4 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:20:11,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 515 transitions. [2023-12-16 04:20:11,779 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 515 transitions. Word has length 99 [2023-12-16 04:20:11,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:11,779 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 515 transitions. [2023-12-16 04:20:11,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:11,780 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 515 transitions. [2023-12-16 04:20:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 04:20:11,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:11,781 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:11,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:11,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-16 04:20:11,988 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:11,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:11,989 INFO L85 PathProgramCache]: Analyzing trace with hash 738649695, now seen corresponding path program 1 times [2023-12-16 04:20:11,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:11,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305649306] [2023-12-16 04:20:11,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:11,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:12,021 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:12,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513413433] [2023-12-16 04:20:12,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:12,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:12,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:12,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-16 04:20:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:12,205 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-16 04:20:12,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:12,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-16 04:20:12,372 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:12,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2023-12-16 04:20:12,384 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 48 proven. 27 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-16 04:20:12,384 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:20:12,575 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-16 04:20:12,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:12,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305649306] [2023-12-16 04:20:12,575 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:12,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513413433] [2023-12-16 04:20:12,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513413433] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:20:12,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:20:12,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-16 04:20:12,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060956393] [2023-12-16 04:20:12,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:20:12,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 04:20:12,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:12,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 04:20:12,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-12-16 04:20:12,578 INFO L87 Difference]: Start difference. First operand 365 states and 515 transitions. Second operand has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-16 04:20:12,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:12,829 INFO L93 Difference]: Finished difference Result 745 states and 1041 transitions. [2023-12-16 04:20:12,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:20:12,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) Word has length 100 [2023-12-16 04:20:12,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:12,832 INFO L225 Difference]: With dead ends: 745 [2023-12-16 04:20:12,833 INFO L226 Difference]: Without dead ends: 373 [2023-12-16 04:20:12,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 187 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:20:12,834 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 216 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:12,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 471 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:20:12,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-16 04:20:12,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 365. [2023-12-16 04:20:12,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 326 states have (on average 1.3466257668711656) internal successors, (439), 329 states have internal predecessors, (439), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:20:12,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 499 transitions. [2023-12-16 04:20:12,853 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 499 transitions. Word has length 100 [2023-12-16 04:20:12,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:12,853 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 499 transitions. [2023-12-16 04:20:12,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.1) internal successors, (61), 12 states have internal predecessors, (61), 4 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (21), 2 states have call predecessors, (21), 4 states have call successors, (21) [2023-12-16 04:20:12,853 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 499 transitions. [2023-12-16 04:20:12,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 04:20:12,855 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:12,855 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:12,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-16 04:20:13,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:13,061 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:13,062 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:13,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1750458576, now seen corresponding path program 1 times [2023-12-16 04:20:13,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:13,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435730820] [2023-12-16 04:20:13,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:13,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:13,094 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:13,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [641494958] [2023-12-16 04:20:13,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:13,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:13,096 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:13,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-16 04:20:13,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:13,283 INFO L262 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 04:20:13,321 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:13,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 04:20:13,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:13,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 12 [2023-12-16 04:20:13,378 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:13,378 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:13,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435730820] [2023-12-16 04:20:13,378 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641494958] [2023-12-16 04:20:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641494958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:13,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:13,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:13,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978278728] [2023-12-16 04:20:13,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:13,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:13,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:13,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:13,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:13,380 INFO L87 Difference]: Start difference. First operand 365 states and 499 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:13,454 INFO L93 Difference]: Finished difference Result 763 states and 1040 transitions. [2023-12-16 04:20:13,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:20:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2023-12-16 04:20:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:13,457 INFO L225 Difference]: With dead ends: 763 [2023-12-16 04:20:13,457 INFO L226 Difference]: Without dead ends: 399 [2023-12-16 04:20:13,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:20:13,458 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 150 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:13,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 388 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-16 04:20:13,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 345. [2023-12-16 04:20:13,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 306 states have (on average 1.3300653594771241) internal successors, (407), 309 states have internal predecessors, (407), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2023-12-16 04:20:13,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 467 transitions. [2023-12-16 04:20:13,477 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 467 transitions. Word has length 100 [2023-12-16 04:20:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:13,477 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 467 transitions. [2023-12-16 04:20:13,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 467 transitions. [2023-12-16 04:20:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-16 04:20:13,478 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:13,479 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:13,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:13,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-16 04:20:13,686 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:13,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:13,686 INFO L85 PathProgramCache]: Analyzing trace with hash 897133028, now seen corresponding path program 1 times [2023-12-16 04:20:13,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:13,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895105805] [2023-12-16 04:20:13,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:13,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:13,717 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:13,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1371823931] [2023-12-16 04:20:13,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:13,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:13,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:13,719 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:13,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-16 04:20:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:20:13,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 04:20:13,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:20:13,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-12-16 04:20:13,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-16 04:20:13,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 13 [2023-12-16 04:20:13,977 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-16 04:20:13,978 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:20:13,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:20:13,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895105805] [2023-12-16 04:20:13,978 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:20:13,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371823931] [2023-12-16 04:20:13,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371823931] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:20:13,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:20:13,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:20:13,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243587271] [2023-12-16 04:20:13,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:20:13,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:20:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:20:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:20:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:20:13,982 INFO L87 Difference]: Start difference. First operand 345 states and 467 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:20:14,033 INFO L93 Difference]: Finished difference Result 587 states and 791 transitions. [2023-12-16 04:20:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:20:14,033 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 100 [2023-12-16 04:20:14,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:20:14,036 INFO L225 Difference]: With dead ends: 587 [2023-12-16 04:20:14,036 INFO L226 Difference]: Without dead ends: 227 [2023-12-16 04:20:14,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:20:14,037 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 36 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:20:14,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 335 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:20:14,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-12-16 04:20:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-12-16 04:20:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 195 states have (on average 1.2871794871794873) internal successors, (251), 197 states have internal predecessors, (251), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-16 04:20:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 301 transitions. [2023-12-16 04:20:14,054 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 301 transitions. Word has length 100 [2023-12-16 04:20:14,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:20:14,054 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 301 transitions. [2023-12-16 04:20:14,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-16 04:20:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 301 transitions. [2023-12-16 04:20:14,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-16 04:20:14,056 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:20:14,056 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:14,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:14,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-16 04:20:14,263 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:20:14,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:20:14,263 INFO L85 PathProgramCache]: Analyzing trace with hash 811712375, now seen corresponding path program 1 times [2023-12-16 04:20:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:20:14,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172325097] [2023-12-16 04:20:14,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:14,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:20:14,286 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:20:14,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1946759328] [2023-12-16 04:20:14,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:20:14,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:20:14,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:20:14,287 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 04:20:14,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-16 04:20:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:20:14,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:20:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:20:14,903 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:20:14,903 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:20:14,904 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:20:14,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-16 04:20:15,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-16 04:20:15,113 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:20:15,115 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:20:15,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:20:15 BoogieIcfgContainer [2023-12-16 04:20:15,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:20:15,224 INFO L158 Benchmark]: Toolchain (without parser) took 10437.13ms. Allocated memory was 308.3MB in the beginning and 370.1MB in the end (delta: 61.9MB). Free memory was 251.6MB in the beginning and 195.7MB in the end (delta: 55.9MB). Peak memory consumption was 118.3MB. Max. memory is 8.0GB. [2023-12-16 04:20:15,224 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 198.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:20:15,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.61ms. Allocated memory is still 308.3MB. Free memory was 251.6MB in the beginning and 237.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-16 04:20:15,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.43ms. Allocated memory is still 308.3MB. Free memory was 236.9MB in the beginning and 233.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 04:20:15,224 INFO L158 Benchmark]: Boogie Preprocessor took 78.76ms. Allocated memory is still 308.3MB. Free memory was 233.7MB in the beginning and 229.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:20:15,225 INFO L158 Benchmark]: RCFGBuilder took 662.66ms. Allocated memory is still 308.3MB. Free memory was 229.0MB in the beginning and 198.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-12-16 04:20:15,225 INFO L158 Benchmark]: TraceAbstraction took 9283.72ms. Allocated memory was 308.3MB in the beginning and 370.1MB in the end (delta: 61.9MB). Free memory was 198.1MB in the beginning and 195.7MB in the end (delta: 2.4MB). Peak memory consumption was 64.8MB. Max. memory is 8.0GB. [2023-12-16 04:20:15,226 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 198.2MB. Free memory is still 143.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.61ms. Allocated memory is still 308.3MB. Free memory was 251.6MB in the beginning and 237.4MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 52.43ms. Allocated memory is still 308.3MB. Free memory was 236.9MB in the beginning and 233.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 78.76ms. Allocated memory is still 308.3MB. Free memory was 233.7MB in the beginning and 229.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 662.66ms. Allocated memory is still 308.3MB. Free memory was 229.0MB in the beginning and 198.6MB in the end (delta: 30.4MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9283.72ms. Allocated memory was 308.3MB in the beginning and 370.1MB in the end (delta: 61.9MB). Free memory was 198.1MB in the beginning and 195.7MB in the end (delta: 2.4MB). Peak memory consumption was 64.8MB. 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of bitwise operation at line 95. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2] = { 0, 0 }; [L25-L27] double double_Array_0[2] = { 1.6, 32.5 }; [L25-L27] double double_Array_0[2] = { 1.6, 32.5 }; [L25-L27] double double_Array_0[2] = { 1.6, 32.5 }; [L28-L30] float float_Array_0[1] = { 15.5 }; [L28-L30] float float_Array_0[1] = { 15.5 }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {64, 0}, {64, -16} }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -64 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { -64 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[1] = { 32 }; [L40] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 32; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] EXPR unsigned_short_int_Array_0[0] [L92] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L102] RET updateLastVariables() [L103] CALL updateVariables() [L72] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] double_Array_0[0] = __VERIFIER_nondet_double() [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F [L76] EXPR double_Array_0[0] [L76] EXPR double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] EXPR (double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854776000e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] double_Array_0[1] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F [L78] EXPR double_Array_0[1] [L78] EXPR double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR (double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854776000e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854776000e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] float_Array_0[0] = __VERIFIER_nondet_float() [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F [L80] EXPR float_Array_0[0] [L80] EXPR float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] EXPR (float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not((float_Array_0[0] >= -922337.2036854776000e+13F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 9223372.036854776000e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L82] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L85] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L88] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L103] RET updateVariables() [L104] CALL step() [L44] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) [L44] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] signed long int stepLocal_0 = (((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_)); [L45] EXPR signed_char_Array_0[1][0] [L45] EXPR signed_char_Array_0[0][1] [L45] EXPR last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_0=32, unsigned_short_int_Array_0={9:0}] [L45] COND TRUE stepLocal_0 <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1])) [L46] EXPR double_Array_0[1] [L46] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L46] COND TRUE (- double_Array_0[1]) >= double_Array_0[0] [L47] EXPR signed_char_Array_0[1][0] [L47] signed_long_int_Array_0[0] = signed_char_Array_0[1][0] [L54] EXPR signed_char_Array_0[0][0] [L54] EXPR signed_long_int_Array_0[0] [L54] signed long int stepLocal_1 = signed_char_Array_0[0][0] + signed_long_int_Array_0[0]; [L55] EXPR float_Array_0[0] [L55] EXPR double_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] COND FALSE !(float_Array_0[0] < double_Array_0[0]) [L62] EXPR BOOL_unsigned_char_Array_0[1] [L62] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L63] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L63] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L64] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L65] EXPR signed_char_Array_0[0][1] [L65] signed_char_Array_0[1][1] = (signed_char_Array_0[0][1] + -32) [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1 [L95] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16)))))) [L95] EXPR signed_char_Array_0[1][1] [L95] EXPR signed_char_Array_0[0][1] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) [L95] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) [L95] EXPR ((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR signed_char_Array_0[1][0] [L95] EXPR signed_char_Array_0[0][1] [L95] EXPR last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])) [L95] EXPR signed_long_int_Array_0[0] [L95] EXPR signed_char_Array_0[0][0] [L95] EXPR (((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR (((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95] EXPR ((((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L95-L96] return ((((! BOOL_unsigned_char_Array_0[0]) ? ((! BOOL_unsigned_char_Array_0[0]) ? (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[0][1] + -32))) : (signed_char_Array_0[1][1] == ((signed char) (signed_char_Array_0[1][0] - ((((signed_char_Array_0[0][0]) < (16)) ? (signed_char_Array_0[0][0]) : (16))))))) : 1) && ((((((signed_char_Array_0[0][0]) > (last_1_unsigned_short_int_Array_0_0_)) ? (signed_char_Array_0[0][0]) : (last_1_unsigned_short_int_Array_0_0_))) <= (signed_char_Array_0[1][0] * (last_1_unsigned_short_int_Array_0_0_ >> signed_char_Array_0[0][1]))) ? (((- double_Array_0[1]) >= double_Array_0[0]) ? (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][0])) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0]))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[0][0])))) && ((float_Array_0[0] < double_Array_0[0]) ? (((signed_char_Array_0[0][0] + signed_long_int_Array_0[0]) <= (~ (signed_long_int_Array_0[0] % -32))) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0])) : (unsigned_short_int_Array_0[0] == ((unsigned short int) signed_char_Array_0[0][0]))) : 1)) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, last_1_unsigned_short_int_Array_0_0_=32, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.1s, OverallIterations: 12, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 945 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 943 mSDsluCounter, 4651 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3294 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 868 IncrementalHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 1357 mSDtfsCounter, 868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1288 GetRequests, 1213 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=365occurred in iteration=8, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 294 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1366 NumberOfCodeBlocks, 1366 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1258 ConstructedInterpolants, 0 QuantifiedInterpolants, 3484 SizeOfPredicates, 53 NumberOfNonLiveVariables, 4121 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 2776/2860 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 04:20:15,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...