/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 01:49:25,974 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 01:49:26,014 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-21 01:49:26,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 01:49:26,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 01:49:26,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 01:49:26,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 01:49:26,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 01:49:26,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 01:49:26,033 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 01:49:26,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 01:49:26,034 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 01:49:26,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 01:49:26,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 01:49:26,035 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 01:49:26,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 01:49:26,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 01:49:26,035 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 01:49:26,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 01:49:26,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 01:49:26,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 01:49:26,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 01:49:26,044 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 01:49:26,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 01:49:26,044 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 01:49:26,044 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 01:49:26,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 01:49:26,045 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 01:49:26,045 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 01:49:26,045 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 01:49:26,045 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 01:49:26,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 01:49:26,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:49:26,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 01:49:26,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 01:49:26,046 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 01:49:26,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 01:49:26,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 01:49:26,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 01:49:26,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 01:49:26,047 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 01:49:26,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 01:49:26,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 01:49:26,052 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 01:49:26,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 01:49:26,230 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 01:49:26,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 01:49:26,233 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 01:49:26,248 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 01:49:26,249 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-84.i [2023-12-21 01:49:27,197 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 01:49:27,356 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 01:49:27,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-84.i [2023-12-21 01:49:27,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89c8c189/247bb3b34484475c9c2774534ceca969/FLAG3eb77682f [2023-12-21 01:49:27,370 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c89c8c189/247bb3b34484475c9c2774534ceca969 [2023-12-21 01:49:27,372 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 01:49:27,373 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 01:49:27,374 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 01:49:27,374 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 01:49:27,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 01:49:27,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,381 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f25a3b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27, skipping insertion in model container [2023-12-21 01:49:27,381 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 01:49:27,519 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-84.i[916,929] [2023-12-21 01:49:27,560 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:49:27,568 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 01:49:27,575 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-84.i[916,929] [2023-12-21 01:49:27,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 01:49:27,608 INFO L206 MainTranslator]: Completed translation [2023-12-21 01:49:27,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27 WrapperNode [2023-12-21 01:49:27,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 01:49:27,609 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 01:49:27,609 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 01:49:27,609 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 01:49:27,622 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,634 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,672 INFO L138 Inliner]: procedures = 29, calls = 158, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 430 [2023-12-21 01:49:27,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 01:49:27,673 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 01:49:27,673 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 01:49:27,673 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 01:49:27,683 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,687 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,708 INFO L175 MemorySlicer]: Split 122 memory accesses to 6 slices as follows [2, 6, 11, 19, 72, 12]. 59 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 2, 3, 7, 2]. The 17 writes are split as follows [0, 1, 2, 4, 8, 2]. [2023-12-21 01:49:27,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,738 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 01:49:27,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 01:49:27,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 01:49:27,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 01:49:27,751 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (1/1) ... [2023-12-21 01:49:27,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 01:49:27,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 01:49:27,775 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-21 01:49:27,794 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-21 01:49:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 01:49:27,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-21 01:49:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-21 01:49:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-12-21 01:49:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-12-21 01:49:27,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-12-21 01:49:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2023-12-21 01:49:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-21 01:49:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-21 01:49:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-12-21 01:49:27,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-12-21 01:49:27,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2023-12-21 01:49:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-21 01:49:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-21 01:49:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-12-21 01:49:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-12-21 01:49:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-12-21 01:49:27,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-12-21 01:49:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-21 01:49:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-21 01:49:27,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 01:49:27,806 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-21 01:49:27,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-12-21 01:49:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-12-21 01:49:27,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 01:49:27,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 01:49:27,919 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 01:49:27,920 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 01:49:28,293 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 01:49:28,338 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 01:49:28,338 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 01:49:28,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:49:28 BoogieIcfgContainer [2023-12-21 01:49:28,339 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 01:49:28,340 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 01:49:28,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 01:49:28,342 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 01:49:28,342 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 01:49:27" (1/3) ... [2023-12-21 01:49:28,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d635d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:49:28, skipping insertion in model container [2023-12-21 01:49:28,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 01:49:27" (2/3) ... [2023-12-21 01:49:28,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3d635d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 01:49:28, skipping insertion in model container [2023-12-21 01:49:28,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 01:49:28" (3/3) ... [2023-12-21 01:49:28,344 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-84.i [2023-12-21 01:49:28,355 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 01:49:28,355 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 01:49:28,386 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 01:49:28,391 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;@5872944c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 01:49:28,391 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 01:49:28,394 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 01:49:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-21 01:49:28,403 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:28,404 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:28,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:28,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:28,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2134703419, now seen corresponding path program 1 times [2023-12-21 01:49:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:28,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605287553] [2023-12-21 01:49:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:28,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:28,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:28,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:28,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605287553] [2023-12-21 01:49:28,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605287553] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:28,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:28,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 01:49:28,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805244753] [2023-12-21 01:49:28,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:28,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 01:49:28,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 01:49:28,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 01:49:28,719 INFO L87 Difference]: Start difference. First operand has 96 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 74 states have internal predecessors, (101), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:28,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:28,757 INFO L93 Difference]: Finished difference Result 189 states and 300 transitions. [2023-12-21 01:49:28,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 01:49:28,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2023-12-21 01:49:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:28,764 INFO L225 Difference]: With dead ends: 189 [2023-12-21 01:49:28,764 INFO L226 Difference]: Without dead ends: 94 [2023-12-21 01:49:28,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-21 01:49:28,772 INFO L413 NwaCegarLoop]: 132 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, 132 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-21 01:49:28,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:28,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-21 01:49:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-12-21 01:49:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 01:49:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 136 transitions. [2023-12-21 01:49:28,809 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 136 transitions. Word has length 145 [2023-12-21 01:49:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:28,809 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 136 transitions. [2023-12-21 01:49:28,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:28,810 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 136 transitions. [2023-12-21 01:49:28,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-21 01:49:28,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:28,812 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:28,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 01:49:28,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:28,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:28,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1901966747, now seen corresponding path program 1 times [2023-12-21 01:49:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559104142] [2023-12-21 01:49:28,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:28,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:29,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:29,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:29,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:29,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:29,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,085 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:29,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:29,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559104142] [2023-12-21 01:49:29,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559104142] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:29,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:29,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:49:29,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891595014] [2023-12-21 01:49:29,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:29,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:49:29,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:29,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:49:29,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:49:29,088 INFO L87 Difference]: Start difference. First operand 94 states and 136 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:29,135 INFO L93 Difference]: Finished difference Result 193 states and 280 transitions. [2023-12-21 01:49:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:49:29,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2023-12-21 01:49:29,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:29,137 INFO L225 Difference]: With dead ends: 193 [2023-12-21 01:49:29,137 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 01:49:29,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-21 01:49:29,138 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 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-21 01:49:29,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:29,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 01:49:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 96. [2023-12-21 01:49:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 74 states have internal predecessors, (98), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 01:49:29,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2023-12-21 01:49:29,148 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 145 [2023-12-21 01:49:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:29,148 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2023-12-21 01:49:29,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2023-12-21 01:49:29,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-21 01:49:29,150 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:29,150 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:29,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 01:49:29,150 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:29,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:29,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1848127975, now seen corresponding path program 1 times [2023-12-21 01:49:29,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:29,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751589515] [2023-12-21 01:49:29,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:29,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:29,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:29,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751589515] [2023-12-21 01:49:29,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751589515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:29,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:29,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 01:49:29,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358676484] [2023-12-21 01:49:29,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:29,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 01:49:29,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:29,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 01:49:29,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 01:49:29,341 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:29,390 INFO L93 Difference]: Finished difference Result 195 states and 280 transitions. [2023-12-21 01:49:29,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 01:49:29,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2023-12-21 01:49:29,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:29,394 INFO L225 Difference]: With dead ends: 195 [2023-12-21 01:49:29,394 INFO L226 Difference]: Without dead ends: 100 [2023-12-21 01:49:29,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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-21 01:49:29,395 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:29,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 384 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:29,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-21 01:49:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2023-12-21 01:49:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 76 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-21 01:49:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2023-12-21 01:49:29,403 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 145 [2023-12-21 01:49:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:29,404 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2023-12-21 01:49:29,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2023-12-21 01:49:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-21 01:49:29,405 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:29,405 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:29,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-21 01:49:29,406 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:29,406 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:29,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1848068393, now seen corresponding path program 1 times [2023-12-21 01:49:29,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:29,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859309565] [2023-12-21 01:49:29,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:29,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:29,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:29,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:29,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:29,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:29,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:29,718 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:29,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:29,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859309565] [2023-12-21 01:49:29,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859309565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:29,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:29,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:29,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336246638] [2023-12-21 01:49:29,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:29,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:29,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:29,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:29,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:29,721 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:29,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:29,904 INFO L93 Difference]: Finished difference Result 326 states and 465 transitions. [2023-12-21 01:49:29,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:49:29,905 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), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 145 [2023-12-21 01:49:29,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:29,910 INFO L225 Difference]: With dead ends: 326 [2023-12-21 01:49:29,910 INFO L226 Difference]: Without dead ends: 229 [2023-12-21 01:49:29,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:49:29,923 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 323 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:29,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 525 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 01:49:29,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-21 01:49:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 195. [2023-12-21 01:49:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 152 states have internal predecessors, (198), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-21 01:49:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 278 transitions. [2023-12-21 01:49:29,959 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 278 transitions. Word has length 145 [2023-12-21 01:49:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:29,959 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 278 transitions. [2023-12-21 01:49:29,959 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), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 278 transitions. [2023-12-21 01:49:29,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-12-21 01:49:29,965 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:29,965 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:29,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-21 01:49:29,965 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:29,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:29,965 INFO L85 PathProgramCache]: Analyzing trace with hash 152864249, now seen corresponding path program 1 times [2023-12-21 01:49:29,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:29,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833602384] [2023-12-21 01:49:29,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:29,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:31,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:31,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:31,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:31,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:31,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833602384] [2023-12-21 01:49:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833602384] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:31,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-21 01:49:31,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39985545] [2023-12-21 01:49:31,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:31,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 01:49:31,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:31,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 01:49:31,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:49:31,376 INFO L87 Difference]: Start difference. First operand 195 states and 278 transitions. Second operand has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:32,002 INFO L93 Difference]: Finished difference Result 578 states and 818 transitions. [2023-12-21 01:49:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 01:49:32,003 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 153 [2023-12-21 01:49:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:32,004 INFO L225 Difference]: With dead ends: 578 [2023-12-21 01:49:32,004 INFO L226 Difference]: Without dead ends: 384 [2023-12-21 01:49:32,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2023-12-21 01:49:32,005 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 298 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:32,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 1294 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:49:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2023-12-21 01:49:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 327. [2023-12-21 01:49:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 268 states have (on average 1.3171641791044777) internal successors, (353), 270 states have internal predecessors, (353), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:49:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 461 transitions. [2023-12-21 01:49:32,025 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 461 transitions. Word has length 153 [2023-12-21 01:49:32,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:32,026 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 461 transitions. [2023-12-21 01:49:32,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.666666666666667) internal successors, (56), 14 states have internal predecessors, (56), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 461 transitions. [2023-12-21 01:49:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:32,027 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:32,027 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:32,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-21 01:49:32,028 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:32,028 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash 535407572, now seen corresponding path program 1 times [2023-12-21 01:49:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218771917] [2023-12-21 01:49:32,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:32,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:32,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:32,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:32,936 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:32,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:32,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218771917] [2023-12-21 01:49:32,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218771917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:32,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:32,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:49:32,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551268510] [2023-12-21 01:49:32,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:32,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:49:32,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:32,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:49:32,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:49:32,938 INFO L87 Difference]: Start difference. First operand 327 states and 461 transitions. Second operand has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:33,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:33,517 INFO L93 Difference]: Finished difference Result 957 states and 1346 transitions. [2023-12-21 01:49:33,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 01:49:33,517 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-21 01:49:33,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:33,522 INFO L225 Difference]: With dead ends: 957 [2023-12-21 01:49:33,522 INFO L226 Difference]: Without dead ends: 631 [2023-12-21 01:49:33,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-21 01:49:33,523 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 158 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:33,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1153 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-21 01:49:33,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2023-12-21 01:49:33,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 367. [2023-12-21 01:49:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 308 states have (on average 1.3311688311688312) internal successors, (410), 310 states have internal predecessors, (410), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:49:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 518 transitions. [2023-12-21 01:49:33,556 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 518 transitions. Word has length 155 [2023-12-21 01:49:33,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:33,556 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 518 transitions. [2023-12-21 01:49:33,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.444444444444445) internal successors, (58), 11 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 518 transitions. [2023-12-21 01:49:33,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:33,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:33,559 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:33,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-21 01:49:33,559 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:33,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:33,559 INFO L85 PathProgramCache]: Analyzing trace with hash -744456106, now seen corresponding path program 1 times [2023-12-21 01:49:33,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:33,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420898204] [2023-12-21 01:49:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:34,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:34,475 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:34,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420898204] [2023-12-21 01:49:34,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420898204] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:34,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:34,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:49:34,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578848689] [2023-12-21 01:49:34,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:34,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:49:34,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:34,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:49:34,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:49:34,477 INFO L87 Difference]: Start difference. First operand 367 states and 518 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:35,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:35,040 INFO L93 Difference]: Finished difference Result 881 states and 1238 transitions. [2023-12-21 01:49:35,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 01:49:35,040 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-21 01:49:35,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:35,043 INFO L225 Difference]: With dead ends: 881 [2023-12-21 01:49:35,043 INFO L226 Difference]: Without dead ends: 515 [2023-12-21 01:49:35,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:49:35,044 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 159 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:35,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1086 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:49:35,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-12-21 01:49:35,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 363. [2023-12-21 01:49:35,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 304 states have (on average 1.3289473684210527) internal successors, (404), 306 states have internal predecessors, (404), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:49:35,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 512 transitions. [2023-12-21 01:49:35,070 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 512 transitions. Word has length 155 [2023-12-21 01:49:35,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:35,071 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 512 transitions. [2023-12-21 01:49:35,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 512 transitions. [2023-12-21 01:49:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:35,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:35,072 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:35,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-21 01:49:35,072 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:35,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:35,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1298567520, now seen corresponding path program 1 times [2023-12-21 01:49:35,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:35,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729988683] [2023-12-21 01:49:35,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:35,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:35,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:35,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:35,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:35,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:35,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:35,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:35,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729988683] [2023-12-21 01:49:35,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729988683] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:35,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:35,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:49:35,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920365293] [2023-12-21 01:49:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:35,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:49:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:35,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:49:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:35,213 INFO L87 Difference]: Start difference. First operand 363 states and 512 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:35,258 INFO L93 Difference]: Finished difference Result 789 states and 1111 transitions. [2023-12-21 01:49:35,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:49:35,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-12-21 01:49:35,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:35,259 INFO L225 Difference]: With dead ends: 789 [2023-12-21 01:49:35,259 INFO L226 Difference]: Without dead ends: 427 [2023-12-21 01:49:35,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-21 01:49:35,261 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 48 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 518 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-21 01:49:35,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 518 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-12-21 01:49:35,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 375. [2023-12-21 01:49:35,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 316 states have (on average 1.3164556962025316) internal successors, (416), 318 states have internal predecessors, (416), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 01:49:35,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 524 transitions. [2023-12-21 01:49:35,284 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 524 transitions. Word has length 155 [2023-12-21 01:49:35,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:35,285 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 524 transitions. [2023-12-21 01:49:35,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 524 transitions. [2023-12-21 01:49:35,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:35,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:35,286 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:35,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-21 01:49:35,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:35,286 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:35,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1999632098, now seen corresponding path program 1 times [2023-12-21 01:49:35,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:35,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244744297] [2023-12-21 01:49:35,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:35,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:36,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:36,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:36,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:36,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:36,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244744297] [2023-12-21 01:49:36,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244744297] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:36,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:36,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-21 01:49:36,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785249175] [2023-12-21 01:49:36,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:36,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 01:49:36,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:36,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 01:49:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-12-21 01:49:36,685 INFO L87 Difference]: Start difference. First operand 375 states and 524 transitions. Second operand has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:38,961 INFO L93 Difference]: Finished difference Result 1674 states and 2314 transitions. [2023-12-21 01:49:38,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-21 01:49:38,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2023-12-21 01:49:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:38,966 INFO L225 Difference]: With dead ends: 1674 [2023-12-21 01:49:38,966 INFO L226 Difference]: Without dead ends: 1300 [2023-12-21 01:49:38,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=298, Invalid=1424, Unknown=0, NotChecked=0, Total=1722 [2023-12-21 01:49:38,968 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 714 mSDsluCounter, 1155 mSDsCounter, 0 mSdLazyCounter, 1279 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 1288 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:38,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 1288 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1279 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-21 01:49:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2023-12-21 01:49:39,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1003. [2023-12-21 01:49:39,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 842 states have (on average 1.3076009501187649) internal successors, (1101), 852 states have internal predecessors, (1101), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 134 states have call predecessors, (144), 144 states have call successors, (144) [2023-12-21 01:49:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1389 transitions. [2023-12-21 01:49:39,065 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1389 transitions. Word has length 155 [2023-12-21 01:49:39,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:39,065 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1389 transitions. [2023-12-21 01:49:39,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 14 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1389 transitions. [2023-12-21 01:49:39,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:39,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:39,067 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:39,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-21 01:49:39,067 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:39,067 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:39,068 INFO L85 PathProgramCache]: Analyzing trace with hash 309196788, now seen corresponding path program 1 times [2023-12-21 01:49:39,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:39,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708966985] [2023-12-21 01:49:39,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:39,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:39,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:39,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:39,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708966985] [2023-12-21 01:49:39,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708966985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:39,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:39,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:49:39,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548303425] [2023-12-21 01:49:39,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:39,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:49:39,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:39,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:49:39,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:49:39,928 INFO L87 Difference]: Start difference. First operand 1003 states and 1389 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:40,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:40,527 INFO L93 Difference]: Finished difference Result 2592 states and 3569 transitions. [2023-12-21 01:49:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 01:49:40,527 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-21 01:49:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:40,533 INFO L225 Difference]: With dead ends: 2592 [2023-12-21 01:49:40,533 INFO L226 Difference]: Without dead ends: 1590 [2023-12-21 01:49:40,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2023-12-21 01:49:40,535 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 255 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:40,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 1210 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:49:40,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2023-12-21 01:49:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1011. [2023-12-21 01:49:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1011 states, 850 states have (on average 1.3047058823529412) internal successors, (1109), 860 states have internal predecessors, (1109), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 134 states have call predecessors, (144), 144 states have call successors, (144) [2023-12-21 01:49:40,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1397 transitions. [2023-12-21 01:49:40,631 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1397 transitions. Word has length 155 [2023-12-21 01:49:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:40,631 INFO L495 AbstractCegarLoop]: Abstraction has 1011 states and 1397 transitions. [2023-12-21 01:49:40,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:40,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1397 transitions. [2023-12-21 01:49:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:40,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:40,633 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:40,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-21 01:49:40,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:40,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:40,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1279151114, now seen corresponding path program 1 times [2023-12-21 01:49:40,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:40,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191205769] [2023-12-21 01:49:40,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:40,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:41,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:41,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:41,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:41,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:41,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:41,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191205769] [2023-12-21 01:49:41,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191205769] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:41,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:41,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-21 01:49:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348736131] [2023-12-21 01:49:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:41,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-21 01:49:41,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-21 01:49:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:49:41,146 INFO L87 Difference]: Start difference. First operand 1011 states and 1397 transitions. Second operand has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:41,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:41,625 INFO L93 Difference]: Finished difference Result 2260 states and 3109 transitions. [2023-12-21 01:49:41,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 01:49:41,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-12-21 01:49:41,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:41,631 INFO L225 Difference]: With dead ends: 2260 [2023-12-21 01:49:41,631 INFO L226 Difference]: Without dead ends: 1250 [2023-12-21 01:49:41,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:49:41,634 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 264 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:41,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 591 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:49:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2023-12-21 01:49:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1023. [2023-12-21 01:49:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 862 states have (on average 1.3004640371229699) internal successors, (1121), 872 states have internal predecessors, (1121), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 134 states have call predecessors, (144), 144 states have call successors, (144) [2023-12-21 01:49:41,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1409 transitions. [2023-12-21 01:49:41,698 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1409 transitions. Word has length 155 [2023-12-21 01:49:41,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:41,698 INFO L495 AbstractCegarLoop]: Abstraction has 1023 states and 1409 transitions. [2023-12-21 01:49:41,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.25) internal successors, (58), 9 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:41,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1409 transitions. [2023-12-21 01:49:41,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:41,700 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:41,700 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:41,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-21 01:49:41,700 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:41,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:41,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2004698932, now seen corresponding path program 1 times [2023-12-21 01:49:41,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:41,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665630275] [2023-12-21 01:49:41,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:41,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:42,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:42,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:42,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665630275] [2023-12-21 01:49:42,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665630275] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:42,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:42,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-21 01:49:42,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033636185] [2023-12-21 01:49:42,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:42,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 01:49:42,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:42,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 01:49:42,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-12-21 01:49:42,612 INFO L87 Difference]: Start difference. First operand 1023 states and 1409 transitions. Second operand has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:43,483 INFO L93 Difference]: Finished difference Result 2198 states and 3020 transitions. [2023-12-21 01:49:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-21 01:49:43,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2023-12-21 01:49:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:43,487 INFO L225 Difference]: With dead ends: 2198 [2023-12-21 01:49:43,487 INFO L226 Difference]: Without dead ends: 1168 [2023-12-21 01:49:43,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:49:43,489 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 203 mSDsluCounter, 1001 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:43,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1153 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 01:49:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2023-12-21 01:49:43,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1003. [2023-12-21 01:49:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 842 states have (on average 1.2980997624703088) internal successors, (1093), 852 states have internal predecessors, (1093), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 134 states have call predecessors, (144), 144 states have call successors, (144) [2023-12-21 01:49:43,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1381 transitions. [2023-12-21 01:49:43,555 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1381 transitions. Word has length 155 [2023-12-21 01:49:43,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:43,555 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1381 transitions. [2023-12-21 01:49:43,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 7.25) internal successors, (58), 11 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1381 transitions. [2023-12-21 01:49:43,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:43,558 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:43,558 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:43,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-21 01:49:43,558 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:43,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:43,559 INFO L85 PathProgramCache]: Analyzing trace with hash -2133645604, now seen corresponding path program 1 times [2023-12-21 01:49:43,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:43,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991736135] [2023-12-21 01:49:43,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:43,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:43,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:43,806 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:43,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:43,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991736135] [2023-12-21 01:49:43,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991736135] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:43,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:43,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:43,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794868869] [2023-12-21 01:49:43,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:43,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:43,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:43,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:43,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:43,808 INFO L87 Difference]: Start difference. First operand 1003 states and 1381 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:43,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:43,905 INFO L93 Difference]: Finished difference Result 2176 states and 2991 transitions. [2023-12-21 01:49:43,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:49:43,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-12-21 01:49:43,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:43,909 INFO L225 Difference]: With dead ends: 2176 [2023-12-21 01:49:43,909 INFO L226 Difference]: Without dead ends: 1174 [2023-12-21 01:49:43,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:49:43,912 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 108 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:43,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 682 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2023-12-21 01:49:43,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 997. [2023-12-21 01:49:43,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 836 states have (on average 1.2930622009569377) internal successors, (1081), 846 states have internal predecessors, (1081), 144 states have call successors, (144), 16 states have call predecessors, (144), 16 states have return successors, (144), 134 states have call predecessors, (144), 144 states have call successors, (144) [2023-12-21 01:49:43,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1369 transitions. [2023-12-21 01:49:43,994 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1369 transitions. Word has length 155 [2023-12-21 01:49:43,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:43,994 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1369 transitions. [2023-12-21 01:49:43,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:43,994 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1369 transitions. [2023-12-21 01:49:43,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:43,996 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:43,996 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:43,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-21 01:49:43,996 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:43,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:43,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1921610966, now seen corresponding path program 1 times [2023-12-21 01:49:43,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540287349] [2023-12-21 01:49:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:44,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:44,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:44,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540287349] [2023-12-21 01:49:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540287349] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:44,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:44,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338468019] [2023-12-21 01:49:44,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:44,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:44,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:44,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:44,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:44,310 INFO L87 Difference]: Start difference. First operand 997 states and 1369 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:44,649 INFO L93 Difference]: Finished difference Result 2188 states and 3003 transitions. [2023-12-21 01:49:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-21 01:49:44,649 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-12-21 01:49:44,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:44,653 INFO L225 Difference]: With dead ends: 2188 [2023-12-21 01:49:44,653 INFO L226 Difference]: Without dead ends: 1192 [2023-12-21 01:49:44,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:49:44,655 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 109 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:44,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 494 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:49:44,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2023-12-21 01:49:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 874. [2023-12-21 01:49:44,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 741 states have (on average 1.2995951417004048) internal successors, (963), 748 states have internal predecessors, (963), 118 states have call successors, (118), 14 states have call predecessors, (118), 14 states have return successors, (118), 111 states have call predecessors, (118), 118 states have call successors, (118) [2023-12-21 01:49:44,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1199 transitions. [2023-12-21 01:49:44,737 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1199 transitions. Word has length 155 [2023-12-21 01:49:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:44,737 INFO L495 AbstractCegarLoop]: Abstraction has 874 states and 1199 transitions. [2023-12-21 01:49:44,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:44,737 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1199 transitions. [2023-12-21 01:49:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:44,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:44,738 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:44,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-21 01:49:44,738 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:44,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1983650580, now seen corresponding path program 1 times [2023-12-21 01:49:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:44,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182348697] [2023-12-21 01:49:44,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:44,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:45,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:45,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:45,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:45,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:45,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:45,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:45,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182348697] [2023-12-21 01:49:45,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182348697] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:45,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:45,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:49:45,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900245066] [2023-12-21 01:49:45,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:45,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:49:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:49:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:49:45,647 INFO L87 Difference]: Start difference. First operand 874 states and 1199 transitions. Second operand has 12 states, 9 states have (on average 6.444444444444445) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:46,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:46,406 INFO L93 Difference]: Finished difference Result 2252 states and 3080 transitions. [2023-12-21 01:49:46,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 01:49:46,406 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.444444444444445) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 155 [2023-12-21 01:49:46,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:46,410 INFO L225 Difference]: With dead ends: 2252 [2023-12-21 01:49:46,410 INFO L226 Difference]: Without dead ends: 1379 [2023-12-21 01:49:46,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-21 01:49:46,413 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 158 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1350 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:46,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1350 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 01:49:46,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2023-12-21 01:49:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 833. [2023-12-21 01:49:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 707 states have (on average 1.2984441301272984) internal successors, (918), 713 states have internal predecessors, (918), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:49:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1140 transitions. [2023-12-21 01:49:46,500 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1140 transitions. Word has length 155 [2023-12-21 01:49:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:46,501 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 1140 transitions. [2023-12-21 01:49:46,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.444444444444445) internal successors, (58), 12 states have internal predecessors, (58), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1140 transitions. [2023-12-21 01:49:46,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:46,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:46,503 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:46,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-21 01:49:46,504 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:46,504 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:46,504 INFO L85 PathProgramCache]: Analyzing trace with hash 703786902, now seen corresponding path program 1 times [2023-12-21 01:49:46,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:46,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744132556] [2023-12-21 01:49:46,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:46,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:47,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:47,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:47,205 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:47,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:47,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744132556] [2023-12-21 01:49:47,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744132556] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:47,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:47,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:49:47,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274608738] [2023-12-21 01:49:47,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:47,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:49:47,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:47,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:49:47,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:49:47,208 INFO L87 Difference]: Start difference. First operand 833 states and 1140 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:47,773 INFO L93 Difference]: Finished difference Result 2055 states and 2806 transitions. [2023-12-21 01:49:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:49:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-21 01:49:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:47,777 INFO L225 Difference]: With dead ends: 2055 [2023-12-21 01:49:47,777 INFO L226 Difference]: Without dead ends: 1223 [2023-12-21 01:49:47,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:49:47,779 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 174 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:47,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 1170 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:49:47,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2023-12-21 01:49:47,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 825. [2023-12-21 01:49:47,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 825 states, 699 states have (on average 1.296137339055794) internal successors, (906), 705 states have internal predecessors, (906), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:49:47,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1128 transitions. [2023-12-21 01:49:47,842 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1128 transitions. Word has length 155 [2023-12-21 01:49:47,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:47,842 INFO L495 AbstractCegarLoop]: Abstraction has 825 states and 1128 transitions. [2023-12-21 01:49:47,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:47,843 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1128 transitions. [2023-12-21 01:49:47,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:47,843 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:47,844 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:47,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-21 01:49:47,844 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:47,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1695400182, now seen corresponding path program 1 times [2023-12-21 01:49:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581006055] [2023-12-21 01:49:47,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:48,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:48,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581006055] [2023-12-21 01:49:48,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581006055] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:48,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:48,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-21 01:49:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966178771] [2023-12-21 01:49:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:48,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 01:49:48,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 01:49:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-12-21 01:49:48,708 INFO L87 Difference]: Start difference. First operand 825 states and 1128 transitions. Second operand has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:49,502 INFO L93 Difference]: Finished difference Result 1847 states and 2519 transitions. [2023-12-21 01:49:49,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:49:49,503 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-21 01:49:49,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:49,508 INFO L225 Difference]: With dead ends: 1847 [2023-12-21 01:49:49,508 INFO L226 Difference]: Without dead ends: 1023 [2023-12-21 01:49:49,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-21 01:49:49,511 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 232 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1363 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:49,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1363 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 01:49:49,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2023-12-21 01:49:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 833. [2023-12-21 01:49:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 707 states have (on average 1.2927864214992928) internal successors, (914), 713 states have internal predecessors, (914), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:49:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1136 transitions. [2023-12-21 01:49:49,636 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1136 transitions. Word has length 155 [2023-12-21 01:49:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:49,636 INFO L495 AbstractCegarLoop]: Abstraction has 833 states and 1136 transitions. [2023-12-21 01:49:49,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.8) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1136 transitions. [2023-12-21 01:49:49,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:49,638 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:49,638 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-21 01:49:49,638 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:49,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash 107052280, now seen corresponding path program 1 times [2023-12-21 01:49:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:49,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577322773] [2023-12-21 01:49:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:49,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:49,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:50,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:50,002 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:50,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:50,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577322773] [2023-12-21 01:49:50,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577322773] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:50,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:50,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:50,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948976671] [2023-12-21 01:49:50,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:50,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:50,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:50,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:50,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:50,004 INFO L87 Difference]: Start difference. First operand 833 states and 1136 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:50,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:50,348 INFO L93 Difference]: Finished difference Result 2385 states and 3229 transitions. [2023-12-21 01:49:50,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:49:50,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-12-21 01:49:50,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:50,353 INFO L225 Difference]: With dead ends: 2385 [2023-12-21 01:49:50,353 INFO L226 Difference]: Without dead ends: 1553 [2023-12-21 01:49:50,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:49:50,355 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 164 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:50,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 439 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:49:50,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2023-12-21 01:49:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 868. [2023-12-21 01:49:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 742 states have (on average 1.2830188679245282) internal successors, (952), 748 states have internal predecessors, (952), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:49:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1174 transitions. [2023-12-21 01:49:50,422 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1174 transitions. Word has length 155 [2023-12-21 01:49:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:50,423 INFO L495 AbstractCegarLoop]: Abstraction has 868 states and 1174 transitions. [2023-12-21 01:49:50,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1174 transitions. [2023-12-21 01:49:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-12-21 01:49:50,424 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:50,424 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:50,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-21 01:49:50,424 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:50,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:50,424 INFO L85 PathProgramCache]: Analyzing trace with hash -904064970, now seen corresponding path program 1 times [2023-12-21 01:49:50,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:50,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19048632] [2023-12-21 01:49:50,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:51,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:51,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:51,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:51,042 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:51,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:51,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19048632] [2023-12-21 01:49:51,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19048632] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:51,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:51,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-21 01:49:51,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839558161] [2023-12-21 01:49:51,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:51,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-21 01:49:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-21 01:49:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-21 01:49:51,045 INFO L87 Difference]: Start difference. First operand 868 states and 1174 transitions. Second operand has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:51,626 INFO L93 Difference]: Finished difference Result 2017 states and 2719 transitions. [2023-12-21 01:49:51,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 01:49:51,632 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 155 [2023-12-21 01:49:51,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:51,635 INFO L225 Difference]: With dead ends: 2017 [2023-12-21 01:49:51,635 INFO L226 Difference]: Without dead ends: 1150 [2023-12-21 01:49:51,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:49:51,637 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 161 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:51,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1377 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 01:49:51,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2023-12-21 01:49:51,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 860. [2023-12-21 01:49:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 734 states have (on average 1.2806539509536785) internal successors, (940), 740 states have internal predecessors, (940), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:49:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1162 transitions. [2023-12-21 01:49:51,700 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1162 transitions. Word has length 155 [2023-12-21 01:49:51,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:51,700 INFO L495 AbstractCegarLoop]: Abstraction has 860 states and 1162 transitions. [2023-12-21 01:49:51,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.25) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1162 transitions. [2023-12-21 01:49:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-21 01:49:51,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:51,701 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:51,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-21 01:49:51,702 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:51,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:51,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1433857265, now seen corresponding path program 1 times [2023-12-21 01:49:51,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:51,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879021082] [2023-12-21 01:49:51,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:52,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:52,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:52,432 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:52,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879021082] [2023-12-21 01:49:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879021082] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:52,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:52,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-21 01:49:52,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765762302] [2023-12-21 01:49:52,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:52,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 01:49:52,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:52,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 01:49:52,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2023-12-21 01:49:52,433 INFO L87 Difference]: Start difference. First operand 860 states and 1162 transitions. Second operand has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:53,472 INFO L93 Difference]: Finished difference Result 2169 states and 2923 transitions. [2023-12-21 01:49:53,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-21 01:49:53,473 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2023-12-21 01:49:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:53,476 INFO L225 Difference]: With dead ends: 2169 [2023-12-21 01:49:53,477 INFO L226 Difference]: Without dead ends: 1310 [2023-12-21 01:49:53,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2023-12-21 01:49:53,478 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 240 mSDsluCounter, 1681 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:53,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1863 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 01:49:53,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2023-12-21 01:49:53,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 920. [2023-12-21 01:49:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 794 states have (on average 1.2846347607052897) internal successors, (1020), 800 states have internal predecessors, (1020), 111 states have call successors, (111), 14 states have call predecessors, (111), 14 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:49:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1242 transitions. [2023-12-21 01:49:53,553 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1242 transitions. Word has length 157 [2023-12-21 01:49:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:53,553 INFO L495 AbstractCegarLoop]: Abstraction has 920 states and 1242 transitions. [2023-12-21 01:49:53,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.285714285714286) internal successors, (60), 16 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:49:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1242 transitions. [2023-12-21 01:49:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-21 01:49:53,555 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:53,555 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:53,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-21 01:49:53,555 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:53,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1849992781, now seen corresponding path program 1 times [2023-12-21 01:49:53,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:53,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754141993] [2023-12-21 01:49:53,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:53,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:53,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:53,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:53,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:53,786 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:53,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:53,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754141993] [2023-12-21 01:49:53,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754141993] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:49:53,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466961739] [2023-12-21 01:49:53,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:53,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:49:53,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:53,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:49:53,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:49:53,787 INFO L87 Difference]: Start difference. First operand 920 states and 1242 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:54,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:54,147 INFO L93 Difference]: Finished difference Result 2525 states and 3389 transitions. [2023-12-21 01:49:54,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 01:49:54,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-12-21 01:49:54,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:54,152 INFO L225 Difference]: With dead ends: 2525 [2023-12-21 01:49:54,152 INFO L226 Difference]: Without dead ends: 1606 [2023-12-21 01:49:54,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-21 01:49:54,154 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 188 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:54,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 566 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:49:54,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2023-12-21 01:49:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 854. [2023-12-21 01:49:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 854 states, 741 states have (on average 1.2739541160593792) internal successors, (944), 746 states have internal predecessors, (944), 99 states have call successors, (99), 13 states have call predecessors, (99), 13 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2023-12-21 01:49:54,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 854 states to 854 states and 1142 transitions. [2023-12-21 01:49:54,221 INFO L78 Accepts]: Start accepts. Automaton has 854 states and 1142 transitions. Word has length 157 [2023-12-21 01:49:54,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:54,221 INFO L495 AbstractCegarLoop]: Abstraction has 854 states and 1142 transitions. [2023-12-21 01:49:54,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:54,221 INFO L276 IsEmpty]: Start isEmpty. Operand 854 states and 1142 transitions. [2023-12-21 01:49:54,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-21 01:49:54,222 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:54,222 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:54,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-21 01:49:54,222 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:54,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:54,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1943330355, now seen corresponding path program 1 times [2023-12-21 01:49:54,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:54,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244403108] [2023-12-21 01:49:54,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:54,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:54,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:54,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:54,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:54,740 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244403108] [2023-12-21 01:49:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244403108] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:54,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:54,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 01:49:54,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918289465] [2023-12-21 01:49:54,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:54,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 01:49:54,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:54,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 01:49:54,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:49:54,742 INFO L87 Difference]: Start difference. First operand 854 states and 1142 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:54,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:54,987 INFO L93 Difference]: Finished difference Result 1635 states and 2191 transitions. [2023-12-21 01:49:54,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:49:54,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2023-12-21 01:49:54,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:54,990 INFO L225 Difference]: With dead ends: 1635 [2023-12-21 01:49:54,990 INFO L226 Difference]: Without dead ends: 782 [2023-12-21 01:49:54,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-21 01:49:54,991 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 23 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:54,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 585 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 01:49:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2023-12-21 01:49:55,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2023-12-21 01:49:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 669 states have (on average 1.2705530642750373) internal successors, (850), 674 states have internal predecessors, (850), 99 states have call successors, (99), 13 states have call predecessors, (99), 13 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2023-12-21 01:49:55,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1048 transitions. [2023-12-21 01:49:55,056 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1048 transitions. Word has length 157 [2023-12-21 01:49:55,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:55,056 INFO L495 AbstractCegarLoop]: Abstraction has 782 states and 1048 transitions. [2023-12-21 01:49:55,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:49:55,056 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1048 transitions. [2023-12-21 01:49:55,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-21 01:49:55,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:55,057 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:55,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-21 01:49:55,058 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:55,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:55,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1096550798, now seen corresponding path program 1 times [2023-12-21 01:49:55,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:55,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98245441] [2023-12-21 01:49:55,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:55,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:55,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:55,167 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98245441] [2023-12-21 01:49:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98245441] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:55,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 01:49:55,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297754079] [2023-12-21 01:49:55,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:55,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 01:49:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:55,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 01:49:55,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 01:49:55,169 INFO L87 Difference]: Start difference. First operand 782 states and 1048 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:55,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:55,289 INFO L93 Difference]: Finished difference Result 1619 states and 2172 transitions. [2023-12-21 01:49:55,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:49:55,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-12-21 01:49:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:55,293 INFO L225 Difference]: With dead ends: 1619 [2023-12-21 01:49:55,293 INFO L226 Difference]: Without dead ends: 838 [2023-12-21 01:49:55,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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-21 01:49:55,295 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 27 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 504 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-21 01:49:55,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 504 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:49:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2023-12-21 01:49:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 803. [2023-12-21 01:49:55,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 690 states have (on average 1.26231884057971) internal successors, (871), 695 states have internal predecessors, (871), 99 states have call successors, (99), 13 states have call predecessors, (99), 13 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2023-12-21 01:49:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1069 transitions. [2023-12-21 01:49:55,382 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1069 transitions. Word has length 157 [2023-12-21 01:49:55,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:55,382 INFO L495 AbstractCegarLoop]: Abstraction has 803 states and 1069 transitions. [2023-12-21 01:49:55,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-21 01:49:55,382 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1069 transitions. [2023-12-21 01:49:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-21 01:49:55,383 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:55,383 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:55,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-21 01:49:55,384 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:55,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:55,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1241730481, now seen corresponding path program 1 times [2023-12-21 01:49:55,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:55,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884343216] [2023-12-21 01:49:55,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:55,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:56,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:56,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884343216] [2023-12-21 01:49:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884343216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-21 01:49:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831662446] [2023-12-21 01:49:56,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:56,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 01:49:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:56,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 01:49:56,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2023-12-21 01:49:56,444 INFO L87 Difference]: Start difference. First operand 803 states and 1069 transitions. Second operand has 13 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:57,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:49:57,723 INFO L93 Difference]: Finished difference Result 1760 states and 2344 transitions. [2023-12-21 01:49:57,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 01:49:57,724 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) Word has length 157 [2023-12-21 01:49:57,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:49:57,727 INFO L225 Difference]: With dead ends: 1760 [2023-12-21 01:49:57,727 INFO L226 Difference]: Without dead ends: 950 [2023-12-21 01:49:57,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-12-21 01:49:57,728 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 150 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-21 01:49:57,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1138 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-21 01:49:57,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2023-12-21 01:49:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 791. [2023-12-21 01:49:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 678 states have (on average 1.261061946902655) internal successors, (855), 683 states have internal predecessors, (855), 99 states have call successors, (99), 13 states have call predecessors, (99), 13 states have return successors, (99), 94 states have call predecessors, (99), 99 states have call successors, (99) [2023-12-21 01:49:57,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1053 transitions. [2023-12-21 01:49:57,812 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1053 transitions. Word has length 157 [2023-12-21 01:49:57,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:49:57,813 INFO L495 AbstractCegarLoop]: Abstraction has 791 states and 1053 transitions. [2023-12-21 01:49:57,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 6.0) internal successors, (60), 13 states have internal predecessors, (60), 4 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 4 states have call successors, (20) [2023-12-21 01:49:57,813 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1053 transitions. [2023-12-21 01:49:57,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-21 01:49:57,814 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:49:57,814 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:49:57,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-21 01:49:57,814 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:49:57,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:49:57,814 INFO L85 PathProgramCache]: Analyzing trace with hash 453771663, now seen corresponding path program 1 times [2023-12-21 01:49:57,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:49:57,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872274598] [2023-12-21 01:49:57,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:49:57,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:49:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:49:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:49:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:49:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:49:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:49:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:49:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:49:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:49:58,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:49:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:49:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:49:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:49:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:49:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:49:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:49:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:49:58,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:49:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:49:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:49:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:49:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:49:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:49:58,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:49:58,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872274598] [2023-12-21 01:49:58,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872274598] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:49:58,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:49:58,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-21 01:49:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360354375] [2023-12-21 01:49:58,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:49:58,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 01:49:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:49:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 01:49:58,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2023-12-21 01:49:58,622 INFO L87 Difference]: Start difference. First operand 791 states and 1053 transitions. Second operand has 17 states, 15 states have (on average 4.0) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:50:00,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:50:00,548 INFO L93 Difference]: Finished difference Result 2098 states and 2773 transitions. [2023-12-21 01:50:00,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 01:50:00,549 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.0) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2023-12-21 01:50:00,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:50:00,552 INFO L225 Difference]: With dead ends: 2098 [2023-12-21 01:50:00,552 INFO L226 Difference]: Without dead ends: 1308 [2023-12-21 01:50:00,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=678, Unknown=0, NotChecked=0, Total=812 [2023-12-21 01:50:00,554 INFO L413 NwaCegarLoop]: 285 mSDtfsCounter, 378 mSDsluCounter, 2635 mSDsCounter, 0 mSdLazyCounter, 2075 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-21 01:50:00,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 2920 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2075 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-21 01:50:00,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2023-12-21 01:50:00,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 901. [2023-12-21 01:50:00,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 774 states have (on average 1.2532299741602067) internal successors, (970), 780 states have internal predecessors, (970), 111 states have call successors, (111), 15 states have call predecessors, (111), 15 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:50:00,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1192 transitions. [2023-12-21 01:50:00,643 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1192 transitions. Word has length 157 [2023-12-21 01:50:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:50:00,643 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1192 transitions. [2023-12-21 01:50:00,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.0) internal successors, (60), 17 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:50:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1192 transitions. [2023-12-21 01:50:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-12-21 01:50:00,644 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:50:00,644 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:50:00,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-21 01:50:00,644 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:50:00,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:50:00,645 INFO L85 PathProgramCache]: Analyzing trace with hash 672626381, now seen corresponding path program 1 times [2023-12-21 01:50:00,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:50:00,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136822681] [2023-12-21 01:50:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:50:00,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:50:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:50:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:50:01,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:50:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:50:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:50:01,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:50:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:50:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:50:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:50:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:50:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:50:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:50:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:50:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:50:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:50:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:50:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:50:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:50:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:50:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:50:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:50:01,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:50:01,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136822681] [2023-12-21 01:50:01,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136822681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:50:01,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:50:01,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-21 01:50:01,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318816966] [2023-12-21 01:50:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:50:01,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-21 01:50:01,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:50:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-21 01:50:01,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2023-12-21 01:50:01,321 INFO L87 Difference]: Start difference. First operand 901 states and 1192 transitions. Second operand has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:50:02,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:50:02,172 INFO L93 Difference]: Finished difference Result 1896 states and 2504 transitions. [2023-12-21 01:50:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-21 01:50:02,173 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 157 [2023-12-21 01:50:02,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:50:02,176 INFO L225 Difference]: With dead ends: 1896 [2023-12-21 01:50:02,176 INFO L226 Difference]: Without dead ends: 996 [2023-12-21 01:50:02,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2023-12-21 01:50:02,179 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 214 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 1116 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 1882 SdHoareTripleChecker+Invalid, 1120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-21 01:50:02,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 1882 Invalid, 1120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1116 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-21 01:50:02,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2023-12-21 01:50:02,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 855. [2023-12-21 01:50:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 728 states have (on average 1.2568681318681318) internal successors, (915), 734 states have internal predecessors, (915), 111 states have call successors, (111), 15 states have call predecessors, (111), 15 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:50:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1137 transitions. [2023-12-21 01:50:02,267 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1137 transitions. Word has length 157 [2023-12-21 01:50:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:50:02,267 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1137 transitions. [2023-12-21 01:50:02,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 4.615384615384615) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-12-21 01:50:02,267 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1137 transitions. [2023-12-21 01:50:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-21 01:50:02,268 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:50:02,268 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:50:02,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-21 01:50:02,268 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:50:02,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:50:02,269 INFO L85 PathProgramCache]: Analyzing trace with hash -113749867, now seen corresponding path program 1 times [2023-12-21 01:50:02,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:50:02,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939928929] [2023-12-21 01:50:02,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:50:02,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:50:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-21 01:50:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-21 01:50:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-21 01:50:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-21 01:50:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-21 01:50:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-21 01:50:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-21 01:50:02,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-21 01:50:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-21 01:50:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-21 01:50:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-21 01:50:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-21 01:50:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-21 01:50:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-21 01:50:02,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-21 01:50:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-21 01:50:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-21 01:50:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-21 01:50:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-21 01:50:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-12-21 01:50:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 01:50:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-21 01:50:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 01:50:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939928929] [2023-12-21 01:50:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939928929] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 01:50:02,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 01:50:02,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-21 01:50:02,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535376485] [2023-12-21 01:50:02,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 01:50:02,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-21 01:50:02,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 01:50:02,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-21 01:50:02,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-21 01:50:02,471 INFO L87 Difference]: Start difference. First operand 855 states and 1137 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:50:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 01:50:02,594 INFO L93 Difference]: Finished difference Result 1913 states and 2535 transitions. [2023-12-21 01:50:02,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 01:50:02,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-12-21 01:50:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 01:50:02,597 INFO L225 Difference]: With dead ends: 1913 [2023-12-21 01:50:02,597 INFO L226 Difference]: Without dead ends: 1059 [2023-12-21 01:50:02,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-21 01:50:02,599 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 74 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 01:50:02,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 641 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 01:50:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2023-12-21 01:50:02,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 855. [2023-12-21 01:50:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 728 states have (on average 1.2486263736263736) internal successors, (909), 734 states have internal predecessors, (909), 111 states have call successors, (111), 15 states have call predecessors, (111), 15 states have return successors, (111), 105 states have call predecessors, (111), 111 states have call successors, (111) [2023-12-21 01:50:02,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1131 transitions. [2023-12-21 01:50:02,684 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1131 transitions. Word has length 159 [2023-12-21 01:50:02,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 01:50:02,685 INFO L495 AbstractCegarLoop]: Abstraction has 855 states and 1131 transitions. [2023-12-21 01:50:02,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-21 01:50:02,685 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1131 transitions. [2023-12-21 01:50:02,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-12-21 01:50:02,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 01:50:02,686 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 01:50:02,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-21 01:50:02,686 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 01:50:02,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 01:50:02,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1166113811, now seen corresponding path program 1 times [2023-12-21 01:50:02,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 01:50:02,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853944845] [2023-12-21 01:50:02,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 01:50:02,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 01:50:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:50:02,845 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 01:50:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 01:50:03,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 01:50:03,064 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 01:50:03,066 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 01:50:03,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-21 01:50:03,070 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 01:50:03,073 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 01:50:03,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 01:50:03 BoogieIcfgContainer [2023-12-21 01:50:03,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 01:50:03,159 INFO L158 Benchmark]: Toolchain (without parser) took 35785.89ms. Allocated memory was 276.8MB in the beginning and 934.3MB in the end (delta: 657.5MB). Free memory was 231.6MB in the beginning and 842.9MB in the end (delta: -611.3MB). Peak memory consumption was 553.5MB. Max. memory is 8.0GB. [2023-12-21 01:50:03,159 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 183.5MB. Free memory was 134.6MB in the beginning and 134.5MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 01:50:03,159 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.19ms. Allocated memory is still 276.8MB. Free memory was 231.6MB in the beginning and 216.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-21 01:50:03,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.83ms. Allocated memory is still 276.8MB. Free memory was 216.5MB in the beginning and 211.6MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 01:50:03,160 INFO L158 Benchmark]: Boogie Preprocessor took 71.60ms. Allocated memory is still 276.8MB. Free memory was 211.6MB in the beginning and 206.0MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-21 01:50:03,161 INFO L158 Benchmark]: RCFGBuilder took 594.23ms. Allocated memory is still 276.8MB. Free memory was 206.0MB in the beginning and 240.3MB in the end (delta: -34.3MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2023-12-21 01:50:03,161 INFO L158 Benchmark]: TraceAbstraction took 34818.08ms. Allocated memory was 276.8MB in the beginning and 934.3MB in the end (delta: 657.5MB). Free memory was 239.8MB in the beginning and 842.9MB in the end (delta: -603.1MB). Peak memory consumption was 561.4MB. Max. memory is 8.0GB. [2023-12-21 01:50:03,166 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 183.5MB. Free memory was 134.6MB in the beginning and 134.5MB in the end (delta: 140.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.19ms. Allocated memory is still 276.8MB. Free memory was 231.6MB in the beginning and 216.5MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.83ms. Allocated memory is still 276.8MB. Free memory was 216.5MB in the beginning and 211.6MB in the end (delta: 4.8MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 71.60ms. Allocated memory is still 276.8MB. Free memory was 211.6MB in the beginning and 206.0MB in the end (delta: 5.6MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 594.23ms. Allocated memory is still 276.8MB. Free memory was 206.0MB in the beginning and 240.3MB in the end (delta: -34.3MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. * TraceAbstraction took 34818.08ms. Allocated memory was 276.8MB in the beginning and 934.3MB in the end (delta: 657.5MB). Free memory was 239.8MB in the beginning and 842.9MB in the end (delta: -603.1MB). Peak memory consumption was 561.4MB. 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 100. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 1 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L25-L27] float float_Array_0[2] = { 10000000000000.926, 1000000.6 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L28-L30] signed short int signed_short_int_Array_0[3] = { -4, 128, 28020 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L31-L33] unsigned char unsigned_char_Array_0[7] = { 128, 0, 5, 8, 64, 25, 128 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 64, 27843 }; [L37] signed short int last_1_signed_short_int_Array_0_0_ = -4; [L38] unsigned short int last_1_unsigned_short_int_Array_0_0_ = 64; [L104] isInitial = 1 [L105] FCALL initially() [L106] COND TRUE 1 [L107] CALL updateLastVariables() [L96] EXPR signed_short_int_Array_0[0] [L96] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L97] EXPR unsigned_short_int_Array_0[0] [L97] last_1_unsigned_short_int_Array_0_0_ = unsigned_short_int_Array_0[0] [L107] RET updateLastVariables() [L108] CALL updateVariables() [L64] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L65] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] float_Array_0[1] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1] [L68] 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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L68] EXPR float_Array_0[1] [L68] 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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] 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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] 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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] 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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] 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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] signed_short_int_Array_0[2] = __VERIFIER_nondet_short() [L70] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not(signed_short_int_Array_0[2] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] EXPR signed_short_int_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] CALL assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] RET assume_abort_if_not(signed_short_int_Array_0[2] <= 32766) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L73] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L76] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] CALL assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] RET assume_abort_if_not(unsigned_char_Array_0[2] != 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L83] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] CALL assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] RET assume_abort_if_not(unsigned_char_Array_0[3] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L86] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_char_Array_0[4] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] EXPR unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] CALL assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L87] RET assume_abort_if_not(unsigned_char_Array_0[4] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L88] unsigned_char_Array_0[5] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] EXPR unsigned_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[5] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L91] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L92] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L92] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 32767) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L108] RET updateVariables() [L109] CALL step() [L42] signed long int stepLocal_0 = last_1_signed_short_int_Array_0_0_; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, stepLocal_0=-4, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L43] COND TRUE stepLocal_0 != last_1_unsigned_short_int_Array_0_0_ [L44] EXPR unsigned_char_Array_0[5] [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L44] EXPR unsigned_char_Array_0[4] [L44] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, stepLocal_0=-4, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L44] EXPR unsigned_char_Array_0[1] [L44] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, stepLocal_0=-4, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] unsigned_char_Array_0[6] = (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))) [L48] BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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] [L49] EXPR unsigned_short_int_Array_0[1] [L49] EXPR unsigned_char_Array_0[3] [L49] unsigned_short_int_Array_0[0] = ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])) [L51] EXPR unsigned_char_Array_0[4] [L51] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L51] COND TRUE ! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1]) [L52] signed_short_int_Array_0[1] = (32 - 8) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L56] EXPR float_Array_0[1] [L56] float_Array_0[0] = float_Array_0[1] [L57] EXPR unsigned_char_Array_0[6] [L57] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) [L109] RET step() [L110] CALL, EXPR property() [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR unsigned_char_Array_0[5] [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR ((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) [L100] EXPR unsigned_char_Array_0[1] [L100] EXPR ((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) [L100] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 [L100] EXPR unsigned_short_int_Array_0[0] [L100] EXPR unsigned_short_int_Array_0[1] [L100] EXPR unsigned_char_Array_0[3] [L100] EXPR BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) [L100] EXPR unsigned_char_Array_0[6] [L100] EXPR signed_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 [L100] EXPR (unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) [L100] EXPR unsigned_char_Array_0[4] [L100] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) [L100] EXPR signed_short_int_Array_0[1] [L100] EXPR (! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR ((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) [L100] EXPR float_Array_0[0] [L100] EXPR float_Array_0[1] [L100] EXPR (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_Array_0={6:0}, unsigned_char_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L100-L101] return (((((last_1_signed_short_int_Array_0_0_ != last_1_unsigned_short_int_Array_0_0_) ? (unsigned_char_Array_0[6] == ((unsigned char) (unsigned_char_Array_0[5] + ((((((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) > (unsigned_char_Array_0[1])) ? (((((unsigned_char_Array_0[4]) < (unsigned_char_Array_0[3])) ? (unsigned_char_Array_0[4]) : (unsigned_char_Array_0[3])))) : (unsigned_char_Array_0[1])))))) : (unsigned_char_Array_0[6] == ((unsigned char) unsigned_char_Array_0[5]))) && (BOOL_unsigned_char_Array_0[0] ? (unsigned_short_int_Array_0[0] == ((unsigned short int) ((unsigned_short_int_Array_0[1] + 23103) - (32 + unsigned_char_Array_0[3])))) : 1)) && ((unsigned_char_Array_0[6] < signed_short_int_Array_0[1]) ? ((((- 8) / (unsigned_char_Array_0[0] - unsigned_char_Array_0[2])) >= unsigned_char_Array_0[3]) ? (signed_short_int_Array_0[0] == ((signed short int) (signed_short_int_Array_0[1] - (signed_short_int_Array_0[2] - unsigned_char_Array_0[2])))) : 1) : 1)) && ((! (unsigned_char_Array_0[4] > unsigned_short_int_Array_0[1])) ? (signed_short_int_Array_0[1] == ((signed short int) (32 - 8))) : (signed_short_int_Array_0[1] == ((signed short int) (unsigned_char_Array_0[0] - unsigned_char_Array_0[5]))))) && (float_Array_0[0] == ((float) float_Array_0[1])) ; [L110] RET, EXPR property() [L110] 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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, last_1_signed_short_int_Array_0_0_=-4, last_1_unsigned_short_int_Array_0_0_=64, signed_short_int_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, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 34.7s, OverallIterations: 28, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4873 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4835 mSDsluCounter, 26696 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22490 mSDsCounter, 283 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15847 IncrementalHoareTripleChecker+Invalid, 16130 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 283 mSolverCounterUnsat, 4206 mSDtfsCounter, 15847 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1629 GetRequests, 1286 SyntacticMatches, 9 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=11, InterpolantAutomatonStates: 311, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 27 MinimizatonAttempts, 6525 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.1s InterpolantComputationTime, 4320 NumberOfCodeBlocks, 4320 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 4134 ConstructedInterpolants, 0 QuantifiedInterpolants, 18565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 20520/20520 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-21 01:50:03,303 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...