/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-24.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:29:37,940 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:29:37,999 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-15 21:29:38,008 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:29:38,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:29:38,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:29:38,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:29:38,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:29:38,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:29:38,026 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:29:38,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:29:38,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:29:38,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:29:38,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:29:38,028 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:29:38,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:29:38,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:29:38,028 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:29:38,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:29:38,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:29:38,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:29:38,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:29:38,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:29:38,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:29:38,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:29:38,033 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:29:38,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:29:38,034 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:29:38,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:29:38,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:29:38,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:29:38,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:29:38,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:38,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:29:38,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:29:38,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:29:38,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:29:38,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:29:38,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:29:38,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:29:38,036 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:29:38,040 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:29:38,040 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:29:38,040 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-15 21:29:38,193 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:29:38,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:29:38,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:29:38,209 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:29:38,209 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:29:38,210 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-24.i [2023-12-15 21:29:39,437 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:29:39,593 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:29:39,594 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-24.i [2023-12-15 21:29:39,606 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab569a8b5/b401ddf68c1e433e83c044ed2974c7b8/FLAGbc8826e7f [2023-12-15 21:29:39,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab569a8b5/b401ddf68c1e433e83c044ed2974c7b8 [2023-12-15 21:29:39,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:29:39,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:29:39,620 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:39,620 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:29:39,623 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:29:39,624 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,625 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e1c77d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39, skipping insertion in model container [2023-12-15 21:29:39,625 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,647 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:29:39,737 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-24.i[916,929] [2023-12-15 21:29:39,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:39,804 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:29:39,819 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-24.i[916,929] [2023-12-15 21:29:39,842 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:29:39,854 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:29:39,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39 WrapperNode [2023-12-15 21:29:39,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:29:39,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:39,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:29:39,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:29:39,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,876 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,905 INFO L138 Inliner]: procedures = 29, calls = 157, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 463 [2023-12-15 21:29:39,905 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:29:39,906 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:29:39,906 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:29:39,906 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:29:39,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,922 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,941 INFO L175 MemorySlicer]: Split 126 memory accesses to 6 slices as follows [2, 27, 23, 56, 7, 11]. 44 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 4, 2, 5, 1, 2]. The 17 writes are split as follows [0, 5, 2, 7, 1, 2]. [2023-12-15 21:29:39,949 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,950 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,964 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,974 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:29:39,975 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:29:39,975 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:29:39,975 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:29:39,975 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (1/1) ... [2023-12-15 21:29:39,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:29:39,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:39,998 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-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:29:40,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:29:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-15 21:29:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:29:40,022 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:29:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:29:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:29:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 21:29:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 21:29:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-15 21:29:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-15 21:29:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:29:40,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:29:40,015 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-15 21:29:40,146 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:29:40,147 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:29:40,536 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:29:40,570 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:29:40,570 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:29:40,570 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:40 BoogieIcfgContainer [2023-12-15 21:29:40,570 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:29:40,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:29:40,572 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:29:40,577 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:29:40,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:29:39" (1/3) ... [2023-12-15 21:29:40,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39220846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:40, skipping insertion in model container [2023-12-15 21:29:40,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:29:39" (2/3) ... [2023-12-15 21:29:40,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39220846 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:29:40, skipping insertion in model container [2023-12-15 21:29:40,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:29:40" (3/3) ... [2023-12-15 21:29:40,580 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-24.i [2023-12-15 21:29:40,592 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:29:40,592 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:29:40,633 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:29:40,638 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;@67ef8aaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:29:40,638 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:29:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:29:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:40,660 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:40,660 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:40,661 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:40,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:40,666 INFO L85 PathProgramCache]: Analyzing trace with hash -339587267, now seen corresponding path program 1 times [2023-12-15 21:29:40,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:40,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942945169] [2023-12-15 21:29:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:40,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:40,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:41,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:41,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,047 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:41,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:41,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942945169] [2023-12-15 21:29:41,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942945169] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:41,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:41,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:29:41,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052939453] [2023-12-15 21:29:41,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:41,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:29:41,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:41,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:29:41,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:29:41,077 INFO L87 Difference]: Start difference. First operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 77 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:41,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:41,112 INFO L93 Difference]: Finished difference Result 185 states and 291 transitions. [2023-12-15 21:29:41,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:29:41,114 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 119 [2023-12-15 21:29:41,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:41,118 INFO L225 Difference]: With dead ends: 185 [2023-12-15 21:29:41,119 INFO L226 Difference]: Without dead ends: 92 [2023-12-15 21:29:41,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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-15 21:29:41,123 INFO L413 NwaCegarLoop]: 130 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, 130 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-15 21:29:41,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:41,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-15 21:29:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-15 21:29:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 75 states have internal predecessors, (104), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:29:41,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 134 transitions. [2023-12-15 21:29:41,173 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 134 transitions. Word has length 119 [2023-12-15 21:29:41,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:41,174 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 134 transitions. [2023-12-15 21:29:41,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:41,174 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 134 transitions. [2023-12-15 21:29:41,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:41,180 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:41,180 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:41,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:29:41,181 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:41,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:41,181 INFO L85 PathProgramCache]: Analyzing trace with hash -393855625, now seen corresponding path program 1 times [2023-12-15 21:29:41,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:41,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520829439] [2023-12-15 21:29:41,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:41,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:41,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:41,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:41,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:41,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520829439] [2023-12-15 21:29:41,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520829439] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:41,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:41,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:29:41,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673528235] [2023-12-15 21:29:41,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:41,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:29:41,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:29:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:41,358 INFO L87 Difference]: Start difference. First operand 92 states and 134 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:41,399 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2023-12-15 21:29:41,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:29:41,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-15 21:29:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:41,404 INFO L225 Difference]: With dead ends: 184 [2023-12-15 21:29:41,404 INFO L226 Difference]: Without dead ends: 93 [2023-12-15 21:29:41,404 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:41,407 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:41,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-12-15 21:29:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-12-15 21:29:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.381578947368421) internal successors, (105), 76 states have internal predecessors, (105), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:29:41,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2023-12-15 21:29:41,415 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 119 [2023-12-15 21:29:41,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:41,416 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2023-12-15 21:29:41,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2023-12-15 21:29:41,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:41,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:41,418 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:41,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:29:41,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:41,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:41,418 INFO L85 PathProgramCache]: Analyzing trace with hash -175000907, now seen corresponding path program 1 times [2023-12-15 21:29:41,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:41,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562049986] [2023-12-15 21:29:41,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:41,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:41,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:41,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:41,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562049986] [2023-12-15 21:29:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562049986] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:29:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001312123] [2023-12-15 21:29:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:41,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:29:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:29:41,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:41,591 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:41,625 INFO L93 Difference]: Finished difference Result 205 states and 299 transitions. [2023-12-15 21:29:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:29:41,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-15 21:29:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:41,628 INFO L225 Difference]: With dead ends: 205 [2023-12-15 21:29:41,629 INFO L226 Difference]: Without dead ends: 113 [2023-12-15 21:29:41,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:29:41,630 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 40 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:41,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 269 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-15 21:29:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 94. [2023-12-15 21:29:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 77 states have (on average 1.3766233766233766) internal successors, (106), 77 states have internal predecessors, (106), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:29:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2023-12-15 21:29:41,643 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 119 [2023-12-15 21:29:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:41,643 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2023-12-15 21:29:41,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2023-12-15 21:29:41,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:41,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:41,644 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:41,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:29:41,645 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:41,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:41,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1454864585, now seen corresponding path program 1 times [2023-12-15 21:29:41,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:41,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907542985] [2023-12-15 21:29:41,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:41,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:41,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,797 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:41,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:41,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907542985] [2023-12-15 21:29:41,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907542985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:41,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:41,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:41,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853998366] [2023-12-15 21:29:41,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:41,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:41,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:41,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:41,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:41,799 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:41,844 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-12-15 21:29:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:41,845 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-15 21:29:41,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:41,847 INFO L225 Difference]: With dead ends: 199 [2023-12-15 21:29:41,847 INFO L226 Difference]: Without dead ends: 106 [2023-12-15 21:29:41,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-15 21:29:41,854 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 21 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:41,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:41,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-15 21:29:41,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2023-12-15 21:29:41,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 79 states have (on average 1.3670886075949367) internal successors, (108), 79 states have internal predecessors, (108), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:29:41,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2023-12-15 21:29:41,868 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 119 [2023-12-15 21:29:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:41,868 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2023-12-15 21:29:41,868 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2023-12-15 21:29:41,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:41,869 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:41,869 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:41,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:29:41,869 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:41,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2030756085, now seen corresponding path program 1 times [2023-12-15 21:29:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247960646] [2023-12-15 21:29:41,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:41,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:41,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:41,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:41,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:41,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:41,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247960646] [2023-12-15 21:29:41,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247960646] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:41,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:41,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:41,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980383900] [2023-12-15 21:29:41,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:41,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:41,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:41,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:41,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:41,993 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:42,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:42,017 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2023-12-15 21:29:42,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:42,017 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-15 21:29:42,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:42,018 INFO L225 Difference]: With dead ends: 199 [2023-12-15 21:29:42,018 INFO L226 Difference]: Without dead ends: 104 [2023-12-15 21:29:42,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-15 21:29:42,019 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 379 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-15 21:29:42,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 379 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:42,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-15 21:29:42,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-15 21:29:42,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:29:42,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-12-15 21:29:42,023 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 119 [2023-12-15 21:29:42,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:42,023 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-12-15 21:29:42,023 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:42,024 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-12-15 21:29:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:42,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:42,025 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:42,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:29:42,025 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:42,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:42,025 INFO L85 PathProgramCache]: Analyzing trace with hash 2088014387, now seen corresponding path program 1 times [2023-12-15 21:29:42,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:42,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207715198] [2023-12-15 21:29:42,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:42,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:42,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:42,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:42,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,182 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:42,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:42,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207715198] [2023-12-15 21:29:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207715198] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:42,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:42,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:29:42,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634113858] [2023-12-15 21:29:42,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:42,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:29:42,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:42,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:29:42,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:29:42,183 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:42,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:42,209 INFO L93 Difference]: Finished difference Result 199 states and 284 transitions. [2023-12-15 21:29:42,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:29:42,209 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-15 21:29:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:42,213 INFO L225 Difference]: With dead ends: 199 [2023-12-15 21:29:42,213 INFO L226 Difference]: Without dead ends: 102 [2023-12-15 21:29:42,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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-15 21:29:42,215 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 3 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:42,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 379 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:42,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-15 21:29:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-15 21:29:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.3493975903614457) internal successors, (112), 83 states have internal predecessors, (112), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-15 21:29:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2023-12-15 21:29:42,227 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 119 [2023-12-15 21:29:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:42,227 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2023-12-15 21:29:42,227 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), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2023-12-15 21:29:42,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 21:29:42,228 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:42,230 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:42,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:29:42,230 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:42,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash 2088073969, now seen corresponding path program 1 times [2023-12-15 21:29:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628957507] [2023-12-15 21:29:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:42,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:42,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628957507] [2023-12-15 21:29:42,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628957507] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:42,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:42,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:29:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682142624] [2023-12-15 21:29:42,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:42,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:42,527 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:42,692 INFO L93 Difference]: Finished difference Result 303 states and 427 transitions. [2023-12-15 21:29:42,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:42,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 119 [2023-12-15 21:29:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:42,694 INFO L225 Difference]: With dead ends: 303 [2023-12-15 21:29:42,694 INFO L226 Difference]: Without dead ends: 204 [2023-12-15 21:29:42,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:42,695 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 148 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:42,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 631 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-15 21:29:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 178. [2023-12-15 21:29:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 149 states have (on average 1.342281879194631) internal successors, (200), 150 states have internal predecessors, (200), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:42,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 252 transitions. [2023-12-15 21:29:42,711 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 252 transitions. Word has length 119 [2023-12-15 21:29:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:42,711 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 252 transitions. [2023-12-15 21:29:42,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 252 transitions. [2023-12-15 21:29:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 21:29:42,712 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:42,713 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:42,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:29:42,713 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:42,713 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:42,713 INFO L85 PathProgramCache]: Analyzing trace with hash 304478038, now seen corresponding path program 1 times [2023-12-15 21:29:42,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:42,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908988212] [2023-12-15 21:29:42,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:42,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:43,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:43,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:43,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,176 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:43,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:43,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908988212] [2023-12-15 21:29:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908988212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:43,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599829169] [2023-12-15 21:29:43,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:43,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:43,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:43,178 INFO L87 Difference]: Start difference. First operand 178 states and 252 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:43,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:43,383 INFO L93 Difference]: Finished difference Result 722 states and 1017 transitions. [2023-12-15 21:29:43,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:43,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-15 21:29:43,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:43,387 INFO L225 Difference]: With dead ends: 722 [2023-12-15 21:29:43,387 INFO L226 Difference]: Without dead ends: 545 [2023-12-15 21:29:43,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-12-15 21:29:43,389 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 334 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:43,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 754 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2023-12-15 21:29:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 196. [2023-12-15 21:29:43,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 167 states have (on average 1.3532934131736527) internal successors, (226), 168 states have internal predecessors, (226), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 278 transitions. [2023-12-15 21:29:43,406 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 278 transitions. Word has length 120 [2023-12-15 21:29:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:43,407 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 278 transitions. [2023-12-15 21:29:43,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 278 transitions. [2023-12-15 21:29:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 21:29:43,409 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:43,409 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:43,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 21:29:43,409 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:43,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1500960296, now seen corresponding path program 1 times [2023-12-15 21:29:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:43,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449881636] [2023-12-15 21:29:43,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:43,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:43,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449881636] [2023-12-15 21:29:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449881636] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749654022] [2023-12-15 21:29:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:43,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:43,751 INFO L87 Difference]: Start difference. First operand 196 states and 278 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:43,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:43,950 INFO L93 Difference]: Finished difference Result 644 states and 912 transitions. [2023-12-15 21:29:43,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 120 [2023-12-15 21:29:43,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:43,952 INFO L225 Difference]: With dead ends: 644 [2023-12-15 21:29:43,952 INFO L226 Difference]: Without dead ends: 449 [2023-12-15 21:29:43,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:43,953 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 426 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:43,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 583 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2023-12-15 21:29:43,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 198. [2023-12-15 21:29:43,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 169 states have (on average 1.3550295857988166) internal successors, (229), 170 states have internal predecessors, (229), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:43,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 281 transitions. [2023-12-15 21:29:43,962 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 281 transitions. Word has length 120 [2023-12-15 21:29:43,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:43,962 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 281 transitions. [2023-12-15 21:29:43,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 281 transitions. [2023-12-15 21:29:43,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 21:29:43,963 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:43,963 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:43,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 21:29:43,964 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:43,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash 163929428, now seen corresponding path program 1 times [2023-12-15 21:29:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:43,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957831232] [2023-12-15 21:29:43,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:44,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:44,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:44,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:44,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:44,490 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:44,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:44,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957831232] [2023-12-15 21:29:44,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957831232] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:44,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:44,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:44,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208909569] [2023-12-15 21:29:44,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:44,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:44,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:44,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:44,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:44,491 INFO L87 Difference]: Start difference. First operand 198 states and 281 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:44,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:44,646 INFO L93 Difference]: Finished difference Result 537 states and 759 transitions. [2023-12-15 21:29:44,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:44,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2023-12-15 21:29:44,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:44,648 INFO L225 Difference]: With dead ends: 537 [2023-12-15 21:29:44,648 INFO L226 Difference]: Without dead ends: 340 [2023-12-15 21:29:44,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:44,649 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 155 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:44,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 897 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2023-12-15 21:29:44,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 197. [2023-12-15 21:29:44,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 168 states have (on average 1.3571428571428572) internal successors, (228), 169 states have internal predecessors, (228), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:44,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 280 transitions. [2023-12-15 21:29:44,656 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 280 transitions. Word has length 120 [2023-12-15 21:29:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:44,656 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 280 transitions. [2023-12-15 21:29:44,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 280 transitions. [2023-12-15 21:29:44,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 21:29:44,657 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:44,657 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:44,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-15 21:29:44,657 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:44,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:44,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1641508906, now seen corresponding path program 1 times [2023-12-15 21:29:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:44,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979931079] [2023-12-15 21:29:44,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:44,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:45,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:45,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:45,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,239 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:45,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:45,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979931079] [2023-12-15 21:29:45,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979931079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:45,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:45,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684331975] [2023-12-15 21:29:45,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:45,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:45,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:45,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:45,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:45,240 INFO L87 Difference]: Start difference. First operand 197 states and 280 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:45,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:45,382 INFO L93 Difference]: Finished difference Result 472 states and 669 transitions. [2023-12-15 21:29:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:45,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 120 [2023-12-15 21:29:45,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:45,384 INFO L225 Difference]: With dead ends: 472 [2023-12-15 21:29:45,384 INFO L226 Difference]: Without dead ends: 276 [2023-12-15 21:29:45,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:45,384 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 218 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:45,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 446 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:45,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-12-15 21:29:45,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 193. [2023-12-15 21:29:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 164 states have (on average 1.3475609756097562) internal successors, (221), 165 states have internal predecessors, (221), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:45,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2023-12-15 21:29:45,394 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 120 [2023-12-15 21:29:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:45,396 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2023-12-15 21:29:45,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:45,397 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2023-12-15 21:29:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:29:45,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:45,397 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:45,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 21:29:45,398 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:45,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1013331468, now seen corresponding path program 1 times [2023-12-15 21:29:45,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:45,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991065207] [2023-12-15 21:29:45,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:45,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:45,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:45,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:45,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:45,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991065207] [2023-12-15 21:29:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991065207] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:45,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:45,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:45,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937522066] [2023-12-15 21:29:45,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:45,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:45,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:45,751 INFO L87 Difference]: Start difference. First operand 193 states and 273 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:45,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:45,949 INFO L93 Difference]: Finished difference Result 750 states and 1055 transitions. [2023-12-15 21:29:45,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:45,950 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-15 21:29:45,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:45,952 INFO L225 Difference]: With dead ends: 750 [2023-12-15 21:29:45,952 INFO L226 Difference]: Without dead ends: 558 [2023-12-15 21:29:45,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:45,953 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 495 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:45,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 583 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:45,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2023-12-15 21:29:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 219. [2023-12-15 21:29:45,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 190 states have (on average 1.3578947368421053) internal successors, (258), 191 states have internal predecessors, (258), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:45,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 310 transitions. [2023-12-15 21:29:45,970 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 310 transitions. Word has length 121 [2023-12-15 21:29:45,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:45,970 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 310 transitions. [2023-12-15 21:29:45,970 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:45,970 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 310 transitions. [2023-12-15 21:29:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:29:45,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:45,972 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:45,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 21:29:45,972 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:45,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:45,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1693287926, now seen corresponding path program 1 times [2023-12-15 21:29:45,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:45,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360936014] [2023-12-15 21:29:45,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:45,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:46,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360936014] [2023-12-15 21:29:46,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360936014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:46,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:46,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832155713] [2023-12-15 21:29:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:46,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:46,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:46,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:46,306 INFO L87 Difference]: Start difference. First operand 219 states and 310 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:46,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:46,500 INFO L93 Difference]: Finished difference Result 728 states and 1025 transitions. [2023-12-15 21:29:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:46,501 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 121 [2023-12-15 21:29:46,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:46,503 INFO L225 Difference]: With dead ends: 728 [2023-12-15 21:29:46,503 INFO L226 Difference]: Without dead ends: 510 [2023-12-15 21:29:46,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:46,504 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 330 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:46,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 738 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2023-12-15 21:29:46,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 223. [2023-12-15 21:29:46,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 194 states have (on average 1.3608247422680413) internal successors, (264), 195 states have internal predecessors, (264), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 316 transitions. [2023-12-15 21:29:46,545 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 316 transitions. Word has length 121 [2023-12-15 21:29:46,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:46,545 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 316 transitions. [2023-12-15 21:29:46,545 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 316 transitions. [2023-12-15 21:29:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:29:46,546 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:46,546 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:46,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 21:29:46,546 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:46,547 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:46,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1075371082, now seen corresponding path program 1 times [2023-12-15 21:29:46,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:46,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319402675] [2023-12-15 21:29:46,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:46,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:47,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:47,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:47,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:47,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:47,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319402675] [2023-12-15 21:29:47,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319402675] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:47,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:47,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:47,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947377589] [2023-12-15 21:29:47,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:47,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:47,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:47,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:47,085 INFO L87 Difference]: Start difference. First operand 223 states and 316 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:47,219 INFO L93 Difference]: Finished difference Result 570 states and 804 transitions. [2023-12-15 21:29:47,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-15 21:29:47,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-15 21:29:47,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:47,221 INFO L225 Difference]: With dead ends: 570 [2023-12-15 21:29:47,221 INFO L226 Difference]: Without dead ends: 348 [2023-12-15 21:29:47,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:47,222 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 156 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:47,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 581 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-12-15 21:29:47,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 222. [2023-12-15 21:29:47,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 193 states have (on average 1.3523316062176165) internal successors, (261), 194 states have internal predecessors, (261), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 313 transitions. [2023-12-15 21:29:47,232 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 313 transitions. Word has length 121 [2023-12-15 21:29:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:47,232 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 313 transitions. [2023-12-15 21:29:47,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 313 transitions. [2023-12-15 21:29:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 21:29:47,233 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:47,233 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:47,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 21:29:47,233 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:47,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:47,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1631248312, now seen corresponding path program 1 times [2023-12-15 21:29:47,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:47,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870510077] [2023-12-15 21:29:47,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:47,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:47,721 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:47,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:47,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870510077] [2023-12-15 21:29:47,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870510077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:47,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:47,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-15 21:29:47,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256359682] [2023-12-15 21:29:47,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:47,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 21:29:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:47,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 21:29:47,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-15 21:29:47,723 INFO L87 Difference]: Start difference. First operand 222 states and 313 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:47,883 INFO L93 Difference]: Finished difference Result 595 states and 834 transitions. [2023-12-15 21:29:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-15 21:29:47,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 121 [2023-12-15 21:29:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:47,898 INFO L225 Difference]: With dead ends: 595 [2023-12-15 21:29:47,898 INFO L226 Difference]: Without dead ends: 374 [2023-12-15 21:29:47,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:29:47,899 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 275 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:47,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 570 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:29:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-12-15 21:29:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 193. [2023-12-15 21:29:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 164 states have (on average 1.329268292682927) internal successors, (218), 165 states have internal predecessors, (218), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 270 transitions. [2023-12-15 21:29:47,909 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 270 transitions. Word has length 121 [2023-12-15 21:29:47,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:47,910 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 270 transitions. [2023-12-15 21:29:47,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 270 transitions. [2023-12-15 21:29:47,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-15 21:29:47,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:47,911 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:47,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 21:29:47,911 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:47,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:47,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1357070055, now seen corresponding path program 1 times [2023-12-15 21:29:47,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:47,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031095678] [2023-12-15 21:29:47,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:47,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:29:48,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:48,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031095678] [2023-12-15 21:29:48,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031095678] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 21:29:48,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204724413] [2023-12-15 21:29:48,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:48,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 21:29:48,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:29:48,448 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-15 21:29:48,453 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-15 21:29:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:48,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-15 21:29:48,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 21:29:48,803 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 25 treesize of output 13 [2023-12-15 21:29:49,044 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 21 treesize of output 20 [2023-12-15 21:29:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 114 proven. 36 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2023-12-15 21:29:49,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 21:29:49,303 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 35 treesize of output 17 [2023-12-15 21:29:49,308 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2023-12-15 21:29:49,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204724413] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 21:29:49,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 21:29:49,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20 [2023-12-15 21:29:49,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195453133] [2023-12-15 21:29:49,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 21:29:49,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-15 21:29:49,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:49,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-15 21:29:49,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-12-15 21:29:49,311 INFO L87 Difference]: Start difference. First operand 193 states and 270 transitions. Second operand has 20 states, 16 states have (on average 5.75) internal successors, (92), 20 states have internal predecessors, (92), 8 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 8 states have call successors, (32) [2023-12-15 21:29:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:49,879 INFO L93 Difference]: Finished difference Result 583 states and 802 transitions. [2023-12-15 21:29:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-12-15 21:29:49,879 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 16 states have (on average 5.75) internal successors, (92), 20 states have internal predecessors, (92), 8 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 8 states have call successors, (32) Word has length 122 [2023-12-15 21:29:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:49,880 INFO L225 Difference]: With dead ends: 583 [2023-12-15 21:29:49,880 INFO L226 Difference]: Without dead ends: 391 [2023-12-15 21:29:49,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 261 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=920, Unknown=0, NotChecked=0, Total=1190 [2023-12-15 21:29:49,882 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 547 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:49,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1193 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-15 21:29:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2023-12-15 21:29:49,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 203. [2023-12-15 21:29:49,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 172 states have (on average 1.313953488372093) internal successors, (226), 173 states have internal predecessors, (226), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-15 21:29:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 278 transitions. [2023-12-15 21:29:49,892 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 278 transitions. Word has length 122 [2023-12-15 21:29:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:49,892 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 278 transitions. [2023-12-15 21:29:49,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 16 states have (on average 5.75) internal successors, (92), 20 states have internal predecessors, (92), 8 states have call successors, (32), 3 states have call predecessors, (32), 6 states have return successors, (32), 4 states have call predecessors, (32), 8 states have call successors, (32) [2023-12-15 21:29:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 278 transitions. [2023-12-15 21:29:49,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-15 21:29:49,893 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:49,893 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:49,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 21:29:50,100 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,SelfDestructingSolverStorable15 [2023-12-15 21:29:50,100 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:50,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:50,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1014669207, now seen corresponding path program 1 times [2023-12-15 21:29:50,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:50,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419886538] [2023-12-15 21:29:50,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:50,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:50,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:50,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:50,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:50,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419886538] [2023-12-15 21:29:50,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419886538] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:50,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:50,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 21:29:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779233899] [2023-12-15 21:29:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:50,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 21:29:50,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:50,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 21:29:50,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:29:50,852 INFO L87 Difference]: Start difference. First operand 203 states and 278 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:51,139 INFO L93 Difference]: Finished difference Result 509 states and 694 transitions. [2023-12-15 21:29:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 21:29:51,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 122 [2023-12-15 21:29:51,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:51,141 INFO L225 Difference]: With dead ends: 509 [2023-12-15 21:29:51,141 INFO L226 Difference]: Without dead ends: 307 [2023-12-15 21:29:51,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-12-15 21:29:51,182 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 175 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:51,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1003 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-15 21:29:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2023-12-15 21:29:51,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 281. [2023-12-15 21:29:51,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 239 states have (on average 1.3096234309623431) internal successors, (313), 241 states have internal predecessors, (313), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 21:29:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 383 transitions. [2023-12-15 21:29:51,201 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 383 transitions. Word has length 122 [2023-12-15 21:29:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:51,201 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 383 transitions. [2023-12-15 21:29:51,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2023-12-15 21:29:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 383 transitions. [2023-12-15 21:29:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 21:29:51,203 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:51,203 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:51,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 21:29:51,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:51,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:51,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1666105052, now seen corresponding path program 1 times [2023-12-15 21:29:51,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:51,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770047951] [2023-12-15 21:29:51,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:51,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:29:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:29:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:29:51,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:29:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:29:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:29:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-15 21:29:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 21:29:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:29:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:29:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:29:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:29:51,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:29:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:29:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 21:29:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:29:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2023-12-15 21:29:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:29:51,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770047951] [2023-12-15 21:29:51,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770047951] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:29:51,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:29:51,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:29:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868880897] [2023-12-15 21:29:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:29:51,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:29:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:29:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:29:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:29:51,325 INFO L87 Difference]: Start difference. First operand 281 states and 383 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:29:51,370 INFO L93 Difference]: Finished difference Result 609 states and 828 transitions. [2023-12-15 21:29:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:29:51,371 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 123 [2023-12-15 21:29:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:29:51,372 INFO L225 Difference]: With dead ends: 609 [2023-12-15 21:29:51,372 INFO L226 Difference]: Without dead ends: 329 [2023-12-15 21:29:51,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-15 21:29:51,373 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 42 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:29:51,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 501 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:29:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-12-15 21:29:51,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 290. [2023-12-15 21:29:51,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 248 states have (on average 1.2983870967741935) internal successors, (322), 250 states have internal predecessors, (322), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2023-12-15 21:29:51,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 392 transitions. [2023-12-15 21:29:51,415 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 392 transitions. Word has length 123 [2023-12-15 21:29:51,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:29:51,416 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 392 transitions. [2023-12-15 21:29:51,416 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2023-12-15 21:29:51,416 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 392 transitions. [2023-12-15 21:29:51,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 21:29:51,417 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:29:51,417 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:29:51,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 21:29:51,418 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:29:51,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:29:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1444352480, now seen corresponding path program 1 times [2023-12-15 21:29:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:29:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882385620] [2023-12-15 21:29:51,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:29:51,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:29:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:29:51,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:29:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:29:51,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:29:51,551 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:29:51,552 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:29:51,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 21:29:51,555 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:29:51,557 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:29:51,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:29:51 BoogieIcfgContainer [2023-12-15 21:29:51,602 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:29:51,602 INFO L158 Benchmark]: Toolchain (without parser) took 11983.16ms. Allocated memory was 266.3MB in the beginning and 608.2MB in the end (delta: 341.8MB). Free memory was 220.6MB in the beginning and 522.7MB in the end (delta: -302.2MB). Peak memory consumption was 40.2MB. Max. memory is 8.0GB. [2023-12-15 21:29:51,602 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 189.8MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:29:51,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.21ms. Allocated memory is still 266.3MB. Free memory was 220.6MB in the beginning and 205.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:29:51,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.53ms. Allocated memory is still 266.3MB. Free memory was 205.9MB in the beginning and 201.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:29:51,603 INFO L158 Benchmark]: Boogie Preprocessor took 68.27ms. Allocated memory is still 266.3MB. Free memory was 201.7MB in the beginning and 197.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:29:51,603 INFO L158 Benchmark]: RCFGBuilder took 595.91ms. Allocated memory is still 266.3MB. Free memory was 197.0MB in the beginning and 165.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-15 21:29:51,603 INFO L158 Benchmark]: TraceAbstraction took 11029.99ms. Allocated memory was 266.3MB in the beginning and 608.2MB in the end (delta: 341.8MB). Free memory was 164.5MB in the beginning and 522.7MB in the end (delta: -358.3MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:29:51,604 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.11ms. Allocated memory is still 189.8MB. Free memory is still 138.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 234.21ms. Allocated memory is still 266.3MB. Free memory was 220.6MB in the beginning and 205.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.53ms. Allocated memory is still 266.3MB. Free memory was 205.9MB in the beginning and 201.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.27ms. Allocated memory is still 266.3MB. Free memory was 201.7MB in the beginning and 197.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 595.91ms. Allocated memory is still 266.3MB. Free memory was 197.0MB in the beginning and 165.0MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11029.99ms. Allocated memory was 266.3MB in the beginning and 608.2MB in the end (delta: 341.8MB). Free memory was 164.5MB in the beginning and 522.7MB in the end (delta: -358.3MB). There was no memory consumed. 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 someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryArithmeticDOUBLEoperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][2] = { {0, 1}, {1, 0} }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L25-L27] float float_Array_0[2] = { 2.25, 199.4 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { -128, 0, 4, 16, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 100 }; [L31-L33] unsigned char unsigned_char_Array_0[1] = { 100 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 55182, 0 }; [L93] isInitial = 1 [L94] FCALL initially() [L95] COND TRUE 1 [L96] FCALL updateLastVariables() [L97] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L72] EXPR float_Array_0[1] [L72] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_short_int_Array_0[0] = __VERIFIER_nondet_ushort() [L83] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_short_int_Array_0[0] >= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_short_int_Array_0[0] <= 65534) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] RET updateVariables() [L98] CALL step() [L40] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L40] COND FALSE !(! BOOL_unsigned_char_Array_0[1][1]) [L43] EXPR BOOL_unsigned_char_Array_0[0][1] [L43] BOOL_unsigned_char_Array_0[0][0] = ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))) [L45] EXPR signed_char_Array_0[2] [L45] unsigned_char_Array_0[0] = signed_char_Array_0[2] [L46] EXPR float_Array_0[1] [L46] float_Array_0[0] = float_Array_0[1] [L47] EXPR signed_char_Array_0[3] [L47] signed_char_Array_0[0] = signed_char_Array_0[3] [L48] EXPR BOOL_unsigned_char_Array_0[0][0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L48] EXPR float_Array_0[0] [L48] BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L49] BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] COND FALSE !(BOOL_unsigned_char_Array_0[0][0]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) [L52] EXPR signed_char_Array_0[3] [L52] EXPR ((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L52] signed_char_Array_0[4] = ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1]))) [L57] EXPR float_Array_0[0] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) [L57] EXPR float_Array_0[0] [L57] EXPR (((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) [L98] RET step() [L99] CALL, EXPR property() [L89] EXPR BOOL_unsigned_char_Array_0[0][0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) [L89] EXPR float_Array_0[0] [L89] EXPR BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) [L89] EXPR signed_char_Array_0[4] [L89] EXPR signed_char_Array_0[3] [L89] EXPR (BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR (((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] EXPR ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89-L90] return ((((((BOOL_unsigned_char_Array_0[0][0] || (64.75f < float_Array_0[0])) ? (BOOL_unsigned_char_Array_0[0][0] ? (signed_char_Array_0[4] == ((signed char) (signed_char_Array_0[3] - signed_char_Array_0[2]))) : (signed_char_Array_0[4] == ((signed char) ((((((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) < (signed_char_Array_0[1])) ? (((((signed_char_Array_0[3]) > (signed_char_Array_0[2])) ? (signed_char_Array_0[3]) : (signed_char_Array_0[2])))) : (signed_char_Array_0[1])))))) : (signed_char_Array_0[4] == ((signed char) signed_char_Array_0[3]))) && (((((((float_Array_0[0] * 127.75)) > ((float_Array_0[0] / 3.4))) ? ((float_Array_0[0] * 127.75)) : ((float_Array_0[0] / 3.4)))) >= float_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) (((((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) < (unsigned_char_Array_0[0])) ? ((unsigned_short_int_Array_0[0] - (22925 - signed_char_Array_0[2]))) : (unsigned_char_Array_0[0]))))) : 1)) && ((! BOOL_unsigned_char_Array_0[1][1]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) ((! BOOL_unsigned_char_Array_0[0][1]) || (! (! 0))))))) && (unsigned_char_Array_0[0] == ((unsigned char) signed_char_Array_0[2]))) && (float_Array_0[0] == ((float) float_Array_0[1]))) && (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[3])) ; [L99] RET, EXPR property() [L99] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, float_Array_0={5:0}, isInitial=1, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.9s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3398 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3377 mSDsluCounter, 10271 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7460 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2347 IncrementalHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 2811 mSDtfsCounter, 2347 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 960 GetRequests, 844 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=290occurred in iteration=18, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 2075 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2410 NumberOfCodeBlocks, 2410 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2388 ConstructedInterpolants, 0 QuantifiedInterpolants, 7060 SizeOfPredicates, 4 NumberOfNonLiveVariables, 433 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 8292/8400 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-15 21:29:51,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...