/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 true -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-19 15:06:54,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:06:54,334 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-19 15:06:54,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:06:54,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:06:54,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:06:54,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:06:54,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:06:54,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:06:54,351 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:06:54,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:06:54,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:06:54,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:06:54,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:06:54,352 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:06:54,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:06:54,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:06:54,353 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:06:54,353 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:06:54,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:06:54,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:06:54,354 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:06:54,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:06:54,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:06:54,355 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:06:54,355 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:06:54,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:06:54,355 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:06:54,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:06:54,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:06:54,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:06:54,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:06:54,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:06:54,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:06:54,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:06:54,356 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:06:54,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:06:54,357 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:06:54,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:06:54,357 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:06:54,357 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:06:54,357 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:06:54,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:06:54,358 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 -> true [2023-12-19 15:06:54,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:06:54,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:06:54,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:06:54,499 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:06:54,499 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:06:54,500 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-19 15:06:55,585 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:06:55,735 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:06:55,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-79.i [2023-12-19 15:06:55,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4009665/995d8cab9719499a9309955c2ea3c74c/FLAGf43838cff [2023-12-19 15:06:55,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd4009665/995d8cab9719499a9309955c2ea3c74c [2023-12-19 15:06:55,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:06:55,755 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:06:55,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:06:55,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:06:55,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:06:55,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:06:55" (1/1) ... [2023-12-19 15:06:55,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b4d4045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:55, skipping insertion in model container [2023-12-19 15:06:55,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:06:55" (1/1) ... [2023-12-19 15:06:55,785 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:06:55,888 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-19 15:06:55,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:06:55,938 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:06:55,946 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-19 15:06:55,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:06:56,016 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:06:56,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56 WrapperNode [2023-12-19 15:06:56,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:06:56,017 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:06:56,017 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:06:56,017 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:06:56,021 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,043 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,074 INFO L138 Inliner]: procedures = 29, calls = 131, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2023-12-19 15:06:56,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:06:56,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:06:56,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:06:56,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:06:56,085 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,089 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,102 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-19 15:06:56,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,102 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,121 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,124 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:06:56,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:06:56,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:06:56,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:06:56,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (1/1) ... [2023-12-19 15:06:56,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:06:56,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:06:56,192 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-19 15:06:56,249 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-19 15:06:56,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:06:56,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:06:56,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:06:56,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-19 15:06:56,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-19 15:06:56,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-19 15:06:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-19 15:06:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-12-19 15:06:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:06:56,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-19 15:06:56,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:06:56,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:06:56,275 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-19 15:06:56,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-19 15:06:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-19 15:06:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-12-19 15:06:56,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:06:56,276 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:06:56,410 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:06:56,412 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:06:56,709 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:06:56,728 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:06:56,728 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:06:56,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:06:56 BoogieIcfgContainer [2023-12-19 15:06:56,729 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:06:56,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:06:56,746 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:06:56,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:06:56,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:06:55" (1/3) ... [2023-12-19 15:06:56,749 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645a248f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:06:56, skipping insertion in model container [2023-12-19 15:06:56,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:06:56" (2/3) ... [2023-12-19 15:06:56,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645a248f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:06:56, skipping insertion in model container [2023-12-19 15:06:56,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:06:56" (3/3) ... [2023-12-19 15:06:56,750 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-79.i [2023-12-19 15:06:56,762 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:06:56,762 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:06:56,797 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:06:56,801 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;@121536df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:06:56,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:06:56,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 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-19 15:06:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 15:06:56,816 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:06:56,817 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] [2023-12-19 15:06:56,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:06:56,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:06:56,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2125189911, now seen corresponding path program 1 times [2023-12-19 15:06:56,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:06:56,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728594892] [2023-12-19 15:06:56,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:56,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:06:56,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:56,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:06:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728594892] [2023-12-19 15:06:56,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-19 15:06:56,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929708063] [2023-12-19 15:06:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:56,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:06:56,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:06:56,991 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-19 15:06:57,001 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-19 15:06:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:57,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-19 15:06:57,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:06:57,206 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-19 15:06:57,206 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:06:57,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929708063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:06:57,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:06:57,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:06:57,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956554813] [2023-12-19 15:06:57,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:06:57,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:06:57,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:06:57,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:06:57,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:06:57,237 INFO L87 Difference]: Start difference. First operand has 86 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 73 states have internal predecessors, (107), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-19 15:06:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:06:57,281 INFO L93 Difference]: Finished difference Result 169 states and 267 transitions. [2023-12-19 15:06:57,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:06:57,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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 96 [2023-12-19 15:06:57,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:06:57,290 INFO L225 Difference]: With dead ends: 169 [2023-12-19 15:06:57,290 INFO L226 Difference]: Without dead ends: 84 [2023-12-19 15:06:57,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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-19 15:06:57,294 INFO L413 NwaCegarLoop]: 120 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, 120 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-19 15:06:57,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:06:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-19 15:06:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-12-19 15:06:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.4366197183098592) internal successors, (102), 71 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-19 15:06:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2023-12-19 15:06:57,337 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 96 [2023-12-19 15:06:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:06:57,337 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2023-12-19 15:06:57,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 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-19 15:06:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2023-12-19 15:06:57,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 15:06:57,341 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:06:57,342 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] [2023-12-19 15:06:57,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 15:06:57,544 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-19 15:06:57,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:06:57,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:06:57,546 INFO L85 PathProgramCache]: Analyzing trace with hash 975626419, now seen corresponding path program 1 times [2023-12-19 15:06:57,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:06:57,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599642087] [2023-12-19 15:06:57,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:57,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:06:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:57,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:06:57,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599642087] [2023-12-19 15:06:57,643 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-19 15:06:57,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897716709] [2023-12-19 15:06:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:57,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:06:57,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:06:57,645 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-19 15:06:57,672 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-19 15:06:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:57,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 15:06:57,802 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:06:57,834 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-19 15:06:57,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:06:57,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897716709] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:06:57,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:06:57,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:06:57,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289485935] [2023-12-19 15:06:57,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:06:57,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:06:57,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:06:57,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:06:57,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:06:57,836 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-19 15:06:57,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:06:57,897 INFO L93 Difference]: Finished difference Result 173 states and 256 transitions. [2023-12-19 15:06:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:06:57,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 96 [2023-12-19 15:06:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:06:57,900 INFO L225 Difference]: With dead ends: 173 [2023-12-19 15:06:57,900 INFO L226 Difference]: Without dead ends: 90 [2023-12-19 15:06:57,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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-19 15:06:57,902 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 10 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 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-19 15:06:57,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:06:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-19 15:06:57,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2023-12-19 15:06:57,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 73 states have (on average 1.4246575342465753) internal successors, (104), 73 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-19 15:06:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2023-12-19 15:06:57,911 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 96 [2023-12-19 15:06:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:06:57,911 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2023-12-19 15:06:57,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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-19 15:06:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2023-12-19 15:06:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 15:06:57,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:06:57,916 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] [2023-12-19 15:06:57,922 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-19 15:06:58,121 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-19 15:06:58,122 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:06:58,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:06:58,123 INFO L85 PathProgramCache]: Analyzing trace with hash -591131531, now seen corresponding path program 1 times [2023-12-19 15:06:58,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:06:58,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562216487] [2023-12-19 15:06:58,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:58,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:06:58,179 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:06:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [623965905] [2023-12-19 15:06:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:58,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:06:58,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:06:58,185 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-19 15:06:58,224 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-19 15:06:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:58,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 15:06:58,348 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:06:58,373 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-19 15:06:58,373 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:06:58,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:06:58,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562216487] [2023-12-19 15:06:58,374 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:06:58,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623965905] [2023-12-19 15:06:58,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623965905] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:06:58,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:06:58,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:06:58,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141319218] [2023-12-19 15:06:58,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:06:58,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:06:58,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:06:58,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:06:58,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:06:58,377 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-19 15:06:58,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:06:58,418 INFO L93 Difference]: Finished difference Result 175 states and 256 transitions. [2023-12-19 15:06:58,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:06:58,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 96 [2023-12-19 15:06:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:06:58,422 INFO L225 Difference]: With dead ends: 175 [2023-12-19 15:06:58,422 INFO L226 Difference]: Without dead ends: 90 [2023-12-19 15:06:58,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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-19 15:06:58,426 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 3 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 348 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-19 15:06:58,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 348 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:06:58,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-12-19 15:06:58,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2023-12-19 15:06:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 75 states have (on average 1.4133333333333333) internal successors, (106), 75 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-19 15:06:58,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 128 transitions. [2023-12-19 15:06:58,435 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 128 transitions. Word has length 96 [2023-12-19 15:06:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:06:58,435 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 128 transitions. [2023-12-19 15:06:58,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-19 15:06:58,435 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 128 transitions. [2023-12-19 15:06:58,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-19 15:06:58,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:06:58,436 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] [2023-12-19 15:06:58,442 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-19 15:06:58,642 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-19 15:06:58,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:06:58,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:06:58,642 INFO L85 PathProgramCache]: Analyzing trace with hash -591071949, now seen corresponding path program 1 times [2023-12-19 15:06:58,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:06:58,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778774191] [2023-12-19 15:06:58,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:58,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:06:58,687 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:06:58,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [5063080] [2023-12-19 15:06:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:58,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:06:58,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:06:58,709 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-19 15:06:58,709 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-19 15:06:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:58,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 15:06:58,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:06:58,864 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-19 15:06:58,865 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:06:58,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:06:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778774191] [2023-12-19 15:06:58,865 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:06:58,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5063080] [2023-12-19 15:06:58,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5063080] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:06:58,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:06:58,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:06:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85687568] [2023-12-19 15:06:58,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:06:58,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:06:58,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:06:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:06:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:06:58,867 INFO L87 Difference]: Start difference. First operand 88 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-19 15:06:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:06:58,900 INFO L93 Difference]: Finished difference Result 195 states and 284 transitions. [2023-12-19 15:06:58,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:06:58,901 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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 96 [2023-12-19 15:06:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:06:58,902 INFO L225 Difference]: With dead ends: 195 [2023-12-19 15:06:58,903 INFO L226 Difference]: Without dead ends: 108 [2023-12-19 15:06:58,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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-19 15:06:58,910 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 46 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 361 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-19 15:06:58,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 361 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:06:58,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-12-19 15:06:58,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 90. [2023-12-19 15:06:58,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 77 states have (on average 1.4025974025974026) internal successors, (108), 77 states have internal predecessors, (108), 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-19 15:06:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 130 transitions. [2023-12-19 15:06:58,919 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 130 transitions. Word has length 96 [2023-12-19 15:06:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:06:58,920 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 130 transitions. [2023-12-19 15:06:58,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 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-19 15:06:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 130 transitions. [2023-12-19 15:06:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2023-12-19 15:06:58,920 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:06:58,920 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-19 15:06:58,931 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-19 15:06:59,126 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-19 15:06:59,126 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:06:59,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:06:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1806543592, now seen corresponding path program 1 times [2023-12-19 15:06:59,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:06:59,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840945844] [2023-12-19 15:06:59,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:06:59,148 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:06:59,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [128497804] [2023-12-19 15:06:59,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:59,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:06:59,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:06:59,149 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-19 15:06:59,168 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-19 15:06:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:59,302 INFO L262 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 15:06:59,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:06:59,331 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-19 15:06:59,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:06:59,354 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-19 15:06:59,361 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-19 15:06:59,362 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:06:59,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:06:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840945844] [2023-12-19 15:06:59,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:06:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128497804] [2023-12-19 15:06:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128497804] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:06:59,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:06:59,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:06:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309538326] [2023-12-19 15:06:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:06:59,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:06:59,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:06:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:06:59,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:06:59,363 INFO L87 Difference]: Start difference. First operand 90 states and 130 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-19 15:06:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:06:59,404 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2023-12-19 15:06:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:06:59,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-19 15:06:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:06:59,405 INFO L225 Difference]: With dead ends: 224 [2023-12-19 15:06:59,405 INFO L226 Difference]: Without dead ends: 135 [2023-12-19 15:06:59,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 94 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-19 15:06:59,406 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 83 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 501 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-19 15:06:59,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 501 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:06:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-12-19 15:06:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 92. [2023-12-19 15:06:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.3924050632911393) internal successors, (110), 79 states have internal predecessors, (110), 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-19 15:06:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 132 transitions. [2023-12-19 15:06:59,411 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 132 transitions. Word has length 98 [2023-12-19 15:06:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:06:59,411 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 132 transitions. [2023-12-19 15:06:59,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 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-19 15:06:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 132 transitions. [2023-12-19 15:06:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-19 15:06:59,412 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:06:59,412 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-19 15:06:59,420 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-19 15:06:59,618 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-19 15:06:59,618 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:06:59,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:06:59,619 INFO L85 PathProgramCache]: Analyzing trace with hash -180782429, now seen corresponding path program 1 times [2023-12-19 15:06:59,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:06:59,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474252322] [2023-12-19 15:06:59,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:59,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:06:59,637 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:06:59,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1873223238] [2023-12-19 15:06:59,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:06:59,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:06:59,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:06:59,639 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-19 15:06:59,655 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-19 15:06:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:06:59,793 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-19 15:06:59,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:06:59,907 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-19 15:07:00,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:07:00,035 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-19 15:07:00,064 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-19 15:07:00,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:07:00,173 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-19 15:07:00,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:00,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474252322] [2023-12-19 15:07:00,173 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:00,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873223238] [2023-12-19 15:07:00,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873223238] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-19 15:07:00,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-19 15:07:00,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2023-12-19 15:07:00,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403055051] [2023-12-19 15:07:00,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:00,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:07:00,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:00,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:07:00,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:07:00,175 INFO L87 Difference]: Start difference. First operand 92 states and 132 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-19 15:07:00,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:00,408 INFO L93 Difference]: Finished difference Result 312 states and 446 transitions. [2023-12-19 15:07:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:07:00,409 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-19 15:07:00,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:00,411 INFO L225 Difference]: With dead ends: 312 [2023-12-19 15:07:00,411 INFO L226 Difference]: Without dead ends: 221 [2023-12-19 15:07:00,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-12-19 15:07:00,413 INFO L413 NwaCegarLoop]: 208 mSDtfsCounter, 186 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 822 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.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:00,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 822 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:07:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-12-19 15:07:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 162. [2023-12-19 15:07:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 139 states have (on average 1.381294964028777) internal successors, (192), 140 states have internal predecessors, (192), 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-19 15:07:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 232 transitions. [2023-12-19 15:07:00,430 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 232 transitions. Word has length 99 [2023-12-19 15:07:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:00,431 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 232 transitions. [2023-12-19 15:07:00,431 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-19 15:07:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 232 transitions. [2023-12-19 15:07:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 15:07:00,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:00,432 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] [2023-12-19 15:07:00,437 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-19 15:07:00,634 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-19 15:07:00,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:00,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:00,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1229228600, now seen corresponding path program 1 times [2023-12-19 15:07:00,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:00,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978580783] [2023-12-19 15:07:00,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:00,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:00,656 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:00,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [652538138] [2023-12-19 15:07:00,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:00,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:00,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:00,657 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-19 15:07:00,676 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-19 15:07:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:00,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-19 15:07:00,821 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:00,847 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-19 15:07:00,852 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-19 15:07:00,852 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978580783] [2023-12-19 15:07:00,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652538138] [2023-12-19 15:07:00,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652538138] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:00,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:00,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:07:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98152074] [2023-12-19 15:07:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:00,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:07:00,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:07:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:07:00,854 INFO L87 Difference]: Start difference. First operand 162 states and 232 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 15:07:00,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:00,973 INFO L93 Difference]: Finished difference Result 458 states and 653 transitions. [2023-12-19 15:07:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:07:00,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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 101 [2023-12-19 15:07:00,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:00,975 INFO L225 Difference]: With dead ends: 458 [2023-12-19 15:07:00,975 INFO L226 Difference]: Without dead ends: 297 [2023-12-19 15:07:00,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 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-19 15:07:00,976 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 105 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:00,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 363 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:07:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-12-19 15:07:00,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 199. [2023-12-19 15:07:00,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 177 states have internal predecessors, (245), 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-19 15:07:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 285 transitions. [2023-12-19 15:07:00,986 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 285 transitions. Word has length 101 [2023-12-19 15:07:00,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:00,986 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 285 transitions. [2023-12-19 15:07:00,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 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-19 15:07:00,986 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 285 transitions. [2023-12-19 15:07:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 15:07:00,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:00,987 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] [2023-12-19 15:07:01,008 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-19 15:07:01,193 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-19 15:07:01,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:01,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:01,194 INFO L85 PathProgramCache]: Analyzing trace with hash -971063162, now seen corresponding path program 1 times [2023-12-19 15:07:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386935030] [2023-12-19 15:07:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:01,211 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:01,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522735800] [2023-12-19 15:07:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:01,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:01,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:01,212 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-19 15:07:01,236 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-19 15:07:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:01,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-19 15:07:01,359 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:01,364 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-19 15:07:01,393 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-19 15:07:01,393 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:01,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386935030] [2023-12-19 15:07:01,393 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:01,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522735800] [2023-12-19 15:07:01,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522735800] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:01,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:01,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:07:01,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239023737] [2023-12-19 15:07:01,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:01,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:07:01,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:01,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:07:01,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:07:01,394 INFO L87 Difference]: Start difference. First operand 199 states and 285 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-19 15:07:01,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:01,520 INFO L93 Difference]: Finished difference Result 587 states and 836 transitions. [2023-12-19 15:07:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:07:01,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 101 [2023-12-19 15:07:01,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:01,522 INFO L225 Difference]: With dead ends: 587 [2023-12-19 15:07:01,522 INFO L226 Difference]: Without dead ends: 389 [2023-12-19 15:07:01,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 96 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-19 15:07:01,523 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 151 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:01,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 631 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:07:01,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2023-12-19 15:07:01,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 371. [2023-12-19 15:07:01,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 336 states have (on average 1.3898809523809523) internal successors, (467), 339 states have internal predecessors, (467), 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-19 15:07:01,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 527 transitions. [2023-12-19 15:07:01,560 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 527 transitions. Word has length 101 [2023-12-19 15:07:01,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:01,560 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 527 transitions. [2023-12-19 15:07:01,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-19 15:07:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 527 transitions. [2023-12-19 15:07:01,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 15:07:01,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:01,562 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] [2023-12-19 15:07:01,580 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-19 15:07:01,762 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-19 15:07:01,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:01,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:01,763 INFO L85 PathProgramCache]: Analyzing trace with hash -943977975, now seen corresponding path program 1 times [2023-12-19 15:07:01,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:01,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166048200] [2023-12-19 15:07:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:01,790 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2126877273] [2023-12-19 15:07:01,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:01,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:01,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:01,791 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-19 15:07:01,815 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-19 15:07:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:01,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 15:07:01,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:01,944 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-19 15:07:01,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:07:01,966 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-19 15:07:01,972 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-19 15:07:01,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:01,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166048200] [2023-12-19 15:07:01,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:01,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126877273] [2023-12-19 15:07:01,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126877273] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:01,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:01,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:07:01,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20517361] [2023-12-19 15:07:01,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:01,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:07:01,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:01,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:07:01,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:07:01,974 INFO L87 Difference]: Start difference. First operand 371 states and 527 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-19 15:07:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:02,032 INFO L93 Difference]: Finished difference Result 826 states and 1165 transitions. [2023-12-19 15:07:02,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:07:02,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 101 [2023-12-19 15:07:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:02,033 INFO L225 Difference]: With dead ends: 826 [2023-12-19 15:07:02,034 INFO L226 Difference]: Without dead ends: 456 [2023-12-19 15:07:02,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 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-19 15:07:02,034 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 127 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:02,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 692 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:07:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-12-19 15:07:02,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 351. [2023-12-19 15:07:02,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 316 states have (on average 1.3765822784810127) internal successors, (435), 319 states have internal predecessors, (435), 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-19 15:07:02,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 495 transitions. [2023-12-19 15:07:02,045 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 495 transitions. Word has length 101 [2023-12-19 15:07:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:02,045 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 495 transitions. [2023-12-19 15:07:02,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-19 15:07:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 495 transitions. [2023-12-19 15:07:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-12-19 15:07:02,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:02,046 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] [2023-12-19 15:07:02,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 15:07:02,252 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-19 15:07:02,252 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:02,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1703613629, now seen corresponding path program 1 times [2023-12-19 15:07:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:02,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403543199] [2023-12-19 15:07:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:02,268 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:02,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1151025553] [2023-12-19 15:07:02,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:02,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:02,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:02,269 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-19 15:07:02,287 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-19 15:07:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:02,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 15:07:02,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:02,436 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-19 15:07:02,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:07:02,462 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-19 15:07:02,468 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-19 15:07:02,468 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:02,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403543199] [2023-12-19 15:07:02,468 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:02,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151025553] [2023-12-19 15:07:02,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151025553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:02,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:02,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:07:02,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812081530] [2023-12-19 15:07:02,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:02,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:07:02,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:07:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:07:02,470 INFO L87 Difference]: Start difference. First operand 351 states and 495 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-19 15:07:02,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:02,518 INFO L93 Difference]: Finished difference Result 783 states and 1092 transitions. [2023-12-19 15:07:02,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:07:02,519 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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 101 [2023-12-19 15:07:02,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:02,522 INFO L225 Difference]: With dead ends: 783 [2023-12-19 15:07:02,522 INFO L226 Difference]: Without dead ends: 433 [2023-12-19 15:07:02,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:07:02,523 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 122 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:02,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 416 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:07:02,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2023-12-19 15:07:02,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 319. [2023-12-19 15:07:02,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 284 states have (on average 1.3626760563380282) internal successors, (387), 287 states have internal predecessors, (387), 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-19 15:07:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 447 transitions. [2023-12-19 15:07:02,535 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 447 transitions. Word has length 101 [2023-12-19 15:07:02,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:02,535 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 447 transitions. [2023-12-19 15:07:02,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 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-19 15:07:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 447 transitions. [2023-12-19 15:07:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-12-19 15:07:02,536 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:02,536 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] [2023-12-19 15:07:02,545 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-19 15:07:02,742 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-19 15:07:02,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:02,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:02,743 INFO L85 PathProgramCache]: Analyzing trace with hash -679221324, now seen corresponding path program 1 times [2023-12-19 15:07:02,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:02,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671960681] [2023-12-19 15:07:02,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:02,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:02,770 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812004773] [2023-12-19 15:07:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:02,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:02,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:02,786 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-19 15:07:02,810 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-19 15:07:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:02,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-19 15:07:02,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:03,054 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 21 treesize of output 9 [2023-12-19 15:07:03,061 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-19 15:07:03,062 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:07:03,208 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-19 15:07:03,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671960681] [2023-12-19 15:07:03,208 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:03,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812004773] [2023-12-19 15:07:03,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812004773] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 15:07:03,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 15:07:03,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-12-19 15:07:03,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620342767] [2023-12-19 15:07:03,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 15:07:03,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:07:03,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:03,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:07:03,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:07:03,211 INFO L87 Difference]: Start difference. First operand 319 states and 447 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 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-19 15:07:03,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:03,340 INFO L93 Difference]: Finished difference Result 661 states and 913 transitions. [2023-12-19 15:07:03,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:07:03,341 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 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 102 [2023-12-19 15:07:03,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:03,342 INFO L225 Difference]: With dead ends: 661 [2023-12-19 15:07:03,342 INFO L226 Difference]: Without dead ends: 343 [2023-12-19 15:07:03,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 192 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:07:03,343 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 193 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:03,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 450 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:07:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2023-12-19 15:07:03,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2023-12-19 15:07:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 296 states have (on average 1.3344594594594594) internal successors, (395), 299 states have internal predecessors, (395), 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-19 15:07:03,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2023-12-19 15:07:03,372 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 102 [2023-12-19 15:07:03,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:03,372 INFO L495 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2023-12-19 15:07:03,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 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-19 15:07:03,372 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2023-12-19 15:07:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-19 15:07:03,373 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:03,373 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-19 15:07:03,381 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-19 15:07:03,579 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-19 15:07:03,579 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:03,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1809290835, now seen corresponding path program 1 times [2023-12-19 15:07:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:03,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744319931] [2023-12-19 15:07:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:03,598 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:03,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070029627] [2023-12-19 15:07:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:03,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:03,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:03,599 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-19 15:07:03,623 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-19 15:07:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:03,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 15:07:03,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:03,767 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-19 15:07:03,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-19 15:07:03,792 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-19 15:07:03,798 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-19 15:07:03,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:03,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:03,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744319931] [2023-12-19 15:07:03,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:03,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070029627] [2023-12-19 15:07:03,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070029627] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:03,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:03,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:07:03,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557460303] [2023-12-19 15:07:03,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:03,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:07:03,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:03,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:07:03,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:07:03,799 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-19 15:07:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:03,827 INFO L93 Difference]: Finished difference Result 581 states and 791 transitions. [2023-12-19 15:07:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:07:03,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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 103 [2023-12-19 15:07:03,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:03,828 INFO L225 Difference]: With dead ends: 581 [2023-12-19 15:07:03,828 INFO L226 Difference]: Without dead ends: 231 [2023-12-19 15:07:03,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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-19 15:07:03,829 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 66 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 371 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-19 15:07:03,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 371 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:07:03,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-12-19 15:07:03,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2023-12-19 15:07:03,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 199 states have (on average 1.3015075376884422) internal successors, (259), 201 states have internal predecessors, (259), 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-19 15:07:03,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 309 transitions. [2023-12-19 15:07:03,837 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 309 transitions. Word has length 103 [2023-12-19 15:07:03,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:03,838 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 309 transitions. [2023-12-19 15:07:03,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-19 15:07:03,838 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 309 transitions. [2023-12-19 15:07:03,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 15:07:03,838 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:03,838 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, 1, 1] [2023-12-19 15:07:03,857 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-19 15:07:04,045 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-19 15:07:04,045 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:04,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash -736197848, now seen corresponding path program 1 times [2023-12-19 15:07:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:04,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979681250] [2023-12-19 15:07:04,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:04,067 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [584906244] [2023-12-19 15:07:04,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:04,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:04,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:04,068 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:07:04,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-19 15:07:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:04,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-19 15:07:04,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:04,374 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 1 [2023-12-19 15:07:04,469 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 29 treesize of output 17 [2023-12-19 15:07:04,510 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 21 treesize of output 13 [2023-12-19 15:07:04,557 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-19 15:07:04,558 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979681250] [2023-12-19 15:07:04,558 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:04,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584906244] [2023-12-19 15:07:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584906244] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:04,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:04,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:07:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860708850] [2023-12-19 15:07:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:04,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:07:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:07:04,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:07:04,559 INFO L87 Difference]: Start difference. First operand 231 states and 309 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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-19 15:07:04,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:04,836 INFO L93 Difference]: Finished difference Result 525 states and 697 transitions. [2023-12-19 15:07:04,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 15:07:04,837 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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 105 [2023-12-19 15:07:04,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:04,838 INFO L225 Difference]: With dead ends: 525 [2023-12-19 15:07:04,838 INFO L226 Difference]: Without dead ends: 334 [2023-12-19 15:07:04,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:07:04,838 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 179 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:04,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 583 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:07:04,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2023-12-19 15:07:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 265. [2023-12-19 15:07:04,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 233 states have (on average 1.2918454935622317) internal successors, (301), 235 states have internal predecessors, (301), 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-19 15:07:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 351 transitions. [2023-12-19 15:07:04,847 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 351 transitions. Word has length 105 [2023-12-19 15:07:04,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:04,847 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 351 transitions. [2023-12-19 15:07:04,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 9 states have internal predecessors, (53), 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-19 15:07:04,847 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 351 transitions. [2023-12-19 15:07:04,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 15:07:04,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:04,848 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, 1, 1] [2023-12-19 15:07:04,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-19 15:07:05,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-19 15:07:05,049 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:05,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1129224858, now seen corresponding path program 1 times [2023-12-19 15:07:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381552643] [2023-12-19 15:07:05,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:05,076 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:05,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518467255] [2023-12-19 15:07:05,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:05,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:05,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:05,136 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:07:05,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-19 15:07:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:05,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-19 15:07:05,303 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:05,438 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 29 treesize of output 17 [2023-12-19 15:07:05,473 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 21 treesize of output 13 [2023-12-19 15:07:05,481 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-19 15:07:05,481 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:05,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:05,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381552643] [2023-12-19 15:07:05,481 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:05,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518467255] [2023-12-19 15:07:05,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518467255] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:05,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:05,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:07:05,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869363221] [2023-12-19 15:07:05,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:05,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:07:05,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:05,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:07:05,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:07:05,482 INFO L87 Difference]: Start difference. First operand 265 states and 351 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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-19 15:07:05,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:05,636 INFO L93 Difference]: Finished difference Result 609 states and 801 transitions. [2023-12-19 15:07:05,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:07:05,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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 105 [2023-12-19 15:07:05,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:05,638 INFO L225 Difference]: With dead ends: 609 [2023-12-19 15:07:05,638 INFO L226 Difference]: Without dead ends: 384 [2023-12-19 15:07:05,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:07:05,639 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 171 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:05,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 287 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:07:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-19 15:07:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 310. [2023-12-19 15:07:05,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 278 states have (on average 1.2733812949640289) internal successors, (354), 280 states have internal predecessors, (354), 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-19 15:07:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 404 transitions. [2023-12-19 15:07:05,650 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 404 transitions. Word has length 105 [2023-12-19 15:07:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:05,651 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 404 transitions. [2023-12-19 15:07:05,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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-19 15:07:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 404 transitions. [2023-12-19 15:07:05,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 15:07:05,651 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:05,652 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, 1, 1] [2023-12-19 15:07:05,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-12-19 15:07:05,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:05,858 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:05,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:05,858 INFO L85 PathProgramCache]: Analyzing trace with hash -674158234, now seen corresponding path program 1 times [2023-12-19 15:07:05,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:05,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948241513] [2023-12-19 15:07:05,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:05,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:05,874 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:05,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2083106778] [2023-12-19 15:07:05,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:05,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:05,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:05,879 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:07:05,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-19 15:07:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:07:06,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-19 15:07:06,061 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:07:06,172 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 24 treesize of output 12 [2023-12-19 15:07:06,204 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 16 treesize of output 8 [2023-12-19 15:07:06,211 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-19 15:07:06,211 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 15:07:06,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:07:06,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948241513] [2023-12-19 15:07:06,211 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 15:07:06,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083106778] [2023-12-19 15:07:06,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083106778] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:07:06,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:07:06,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:07:06,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366659550] [2023-12-19 15:07:06,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:07:06,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:07:06,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:07:06,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:07:06,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:07:06,213 INFO L87 Difference]: Start difference. First operand 310 states and 404 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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-19 15:07:06,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:07:06,402 INFO L93 Difference]: Finished difference Result 621 states and 805 transitions. [2023-12-19 15:07:06,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:07:06,403 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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 105 [2023-12-19 15:07:06,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:07:06,404 INFO L225 Difference]: With dead ends: 621 [2023-12-19 15:07:06,404 INFO L226 Difference]: Without dead ends: 351 [2023-12-19 15:07:06,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 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-19 15:07:06,406 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 122 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:07:06,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 313 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:07:06,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-12-19 15:07:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 310. [2023-12-19 15:07:06,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 278 states have (on average 1.2661870503597121) internal successors, (352), 280 states have internal predecessors, (352), 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-19 15:07:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 402 transitions. [2023-12-19 15:07:06,417 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 402 transitions. Word has length 105 [2023-12-19 15:07:06,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:07:06,417 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 402 transitions. [2023-12-19 15:07:06,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 5 states have internal predecessors, (53), 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-19 15:07:06,417 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 402 transitions. [2023-12-19 15:07:06,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 15:07:06,418 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:07:06,418 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, 1, 1] [2023-12-19 15:07:06,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-12-19 15:07:06,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-19 15:07:06,624 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:07:06,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:07:06,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1067185244, now seen corresponding path program 1 times [2023-12-19 15:07:06,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:07:06,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947256735] [2023-12-19 15:07:06,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:06,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:07:06,639 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 15:07:06,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1943432855] [2023-12-19 15:07:06,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:07:06,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:07:06,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:07:06,640 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:07:06,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-19 15:07:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:07:06,945 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:07:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:07:07,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:07:07,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:07:07,091 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:07:07,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-12-19 15:07:07,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-12-19 15:07:07,301 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:07:07,303 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:07:07,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:07:07 BoogieIcfgContainer [2023-12-19 15:07:07,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:07:07,393 INFO L158 Benchmark]: Toolchain (without parser) took 11637.62ms. Allocated memory was 249.6MB in the beginning and 423.6MB in the end (delta: 174.1MB). Free memory was 192.8MB in the beginning and 202.4MB in the end (delta: -9.7MB). Peak memory consumption was 164.6MB. Max. memory is 8.0GB. [2023-12-19 15:07:07,393 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 249.6MB. Free memory is still 196.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:07:07,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.29ms. Allocated memory is still 249.6MB. Free memory was 192.5MB in the beginning and 178.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:07:07,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.38ms. Allocated memory is still 249.6MB. Free memory was 178.1MB in the beginning and 174.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 15:07:07,396 INFO L158 Benchmark]: Boogie Preprocessor took 56.14ms. Allocated memory is still 249.6MB. Free memory was 174.6MB in the beginning and 170.1MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 15:07:07,396 INFO L158 Benchmark]: RCFGBuilder took 597.41ms. Allocated memory is still 249.6MB. Free memory was 170.1MB in the beginning and 208.3MB in the end (delta: -38.2MB). Peak memory consumption was 33.1MB. Max. memory is 8.0GB. [2023-12-19 15:07:07,396 INFO L158 Benchmark]: TraceAbstraction took 10662.35ms. Allocated memory was 249.6MB in the beginning and 423.6MB in the end (delta: 174.1MB). Free memory was 207.6MB in the beginning and 202.4MB in the end (delta: 5.1MB). Peak memory consumption was 179.7MB. Max. memory is 8.0GB. [2023-12-19 15:07:07,398 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.09ms. Allocated memory is still 249.6MB. Free memory is still 196.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 259.29ms. Allocated memory is still 249.6MB. Free memory was 192.5MB in the beginning and 178.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.38ms. Allocated memory is still 249.6MB. Free memory was 178.1MB in the beginning and 174.6MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.14ms. Allocated memory is still 249.6MB. Free memory was 174.6MB in the beginning and 170.1MB in the end (delta: 4.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 597.41ms. Allocated memory is still 249.6MB. Free memory was 170.1MB in the beginning and 208.3MB in the end (delta: -38.2MB). Peak memory consumption was 33.1MB. Max. memory is 8.0GB. * TraceAbstraction took 10662.35ms. Allocated memory was 249.6MB in the beginning and 423.6MB in the end (delta: 174.1MB). Free memory was 207.6MB in the beginning and 202.4MB in the end (delta: 5.1MB). Peak memory consumption was 179.7MB. 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 shiftRight 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] 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}] [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] 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 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, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 16, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1566 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1564 mSDsluCounter, 6610 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4740 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1768 IncrementalHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 1870 mSDtfsCounter, 1768 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1723 GetRequests, 1626 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371occurred in iteration=8, InterpolantAutomatonStates: 106, 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, 15 MinimizatonAttempts, 653 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1802 NumberOfCodeBlocks, 1802 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1689 ConstructedInterpolants, 0 QuantifiedInterpolants, 5262 SizeOfPredicates, 78 NumberOfNonLiveVariables, 5760 ConjunctsInSsa, 162 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 3656/3740 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-19 15:07:07,432 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...