./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:22:13,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:22:13,309 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:22:13,312 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:22:13,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:22:13,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:22:13,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:22:13,329 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:22:13,329 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:22:13,329 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:22:13,330 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:22:13,330 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:22:13,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:22:13,331 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:22:13,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:22:13,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:22:13,331 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:22:13,332 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:22:13,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:22:13,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:22:13,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:22:13,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:22:13,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:22:13,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:22:13,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:22:13,334 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:22:13,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:22:13,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:22:13,335 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:22:13,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:22:13,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:22:13,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:22:13,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:22:13,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:22:13,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:22:13,337 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:22:13,337 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:22:13,337 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:22:13,337 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:22:13,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:22:13,338 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:22:13,338 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:22:13,338 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d [2024-11-16 18:22:13,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:22:13,530 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:22:13,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:22:13,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:22:13,535 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:22:13,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2024-11-16 18:22:14,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:22:14,922 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:22:14,925 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2024-11-16 18:22:14,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592673e8b/76c6e669228042eebf8ce45244ad35ee/FLAG3d4119074 [2024-11-16 18:22:14,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/592673e8b/76c6e669228042eebf8ce45244ad35ee [2024-11-16 18:22:14,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:22:14,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:22:14,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:22:14,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:22:14,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:22:14,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:22:14" (1/1) ... [2024-11-16 18:22:14,955 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aca1a84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:14, skipping insertion in model container [2024-11-16 18:22:14,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:22:14" (1/1) ... [2024-11-16 18:22:14,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:22:15,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i[917,930] [2024-11-16 18:22:15,175 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:22:15,188 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:22:15,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i[917,930] [2024-11-16 18:22:15,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:22:15,235 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:22:15,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15 WrapperNode [2024-11-16 18:22:15,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:22:15,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:22:15,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:22:15,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:22:15,241 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,291 INFO L138 Inliner]: procedures = 29, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 483 [2024-11-16 18:22:15,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:22:15,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:22:15,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:22:15,292 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:22:15,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,367 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 44, 21, 11, 31]. 38 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 2, 2]. The 15 writes are split as follows [0, 1, 5, 4, 3, 2]. [2024-11-16 18:22:15,367 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,367 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,399 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:22:15,404 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:22:15,404 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:22:15,404 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:22:15,405 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (1/1) ... [2024-11-16 18:22:15,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:22:15,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:22:15,451 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) [2024-11-16 18:22:15,462 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 [2024-11-16 18:22:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:22:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-16 18:22:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-16 18:22:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-16 18:22:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-16 18:22:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-16 18:22:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-16 18:22:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 18:22:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 18:22:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-16 18:22:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-16 18:22:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-16 18:22:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-16 18:22:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-16 18:22:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-16 18:22:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-16 18:22:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-16 18:22:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-16 18:22:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-16 18:22:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 18:22:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 18:22:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-16 18:22:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-16 18:22:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-16 18:22:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-16 18:22:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-16 18:22:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-16 18:22:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-16 18:22:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-16 18:22:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-16 18:22:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-16 18:22:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:22:15,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:22:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:22:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 18:22:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 18:22:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 18:22:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-16 18:22:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-16 18:22:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:22:15,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:22:15,648 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:22:15,650 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:22:15,974 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem71#1;havoc property_#t~mem72#1;havoc property_#t~bitwise73#1;havoc property_#t~mem74#1;havoc property_#t~ite79#1;havoc property_#t~mem75#1;havoc property_#t~mem78#1;havoc property_#t~mem76#1;havoc property_#t~mem77#1;havoc property_#t~mem80#1;havoc property_#t~ite83#1;havoc property_#t~mem82#1;havoc property_#t~mem81#1;havoc property_#t~short84#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~bitwise87#1;havoc property_#t~bitwise89#1;havoc property_#t~ite102#1;havoc property_#t~mem101#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite100#1;havoc property_#t~mem96#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~short103#1;havoc property_#t~mem104#1;havoc property_#t~ite115#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem109#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite114#1;havoc property_#t~mem111#1;havoc property_#t~mem110#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~short116#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~short119#1;havoc property_#t~mem121#1;havoc property_#t~mem120#1;havoc property_#t~short122#1; [2024-11-16 18:22:16,018 INFO L? ?]: Removed 138 outVars from TransFormulas that were not future-live. [2024-11-16 18:22:16,018 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:22:16,042 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:22:16,043 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:22:16,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:22:16 BoogieIcfgContainer [2024-11-16 18:22:16,044 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:22:16,045 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:22:16,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:22:16,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:22:16,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:22:14" (1/3) ... [2024-11-16 18:22:16,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f3de2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:22:16, skipping insertion in model container [2024-11-16 18:22:16,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:15" (2/3) ... [2024-11-16 18:22:16,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f3de2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:22:16, skipping insertion in model container [2024-11-16 18:22:16,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:22:16" (3/3) ... [2024-11-16 18:22:16,052 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-33.i [2024-11-16 18:22:16,064 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:22:16,064 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:22:16,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:22:16,114 INFO L333 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, 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;@34c762b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:22:16,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:22:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:22:16,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:16,128 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:16,128 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:16,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:16,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:16,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1155992025, now seen corresponding path program 1 times [2024-11-16 18:22:16,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:16,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694115010] [2024-11-16 18:22:16,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:16,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,435 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:16,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:16,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694115010] [2024-11-16 18:22:16,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694115010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:16,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:16,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:22:16,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010819778] [2024-11-16 18:22:16,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:16,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:22:16,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:16,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:22:16,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:22:16,500 INFO L87 Difference]: Start difference. First operand has 110 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 99 states have internal predecessors, (143), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:16,574 INFO L93 Difference]: Finished difference Result 212 states and 324 transitions. [2024-11-16 18:22:16,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:22:16,578 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-16 18:22:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:16,586 INFO L225 Difference]: With dead ends: 212 [2024-11-16 18:22:16,586 INFO L226 Difference]: Without dead ends: 105 [2024-11-16 18:22:16,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:22:16,595 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:16,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-16 18:22:16,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-16 18:22:16,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:22:16,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2024-11-16 18:22:16,635 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 100 [2024-11-16 18:22:16,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:16,636 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2024-11-16 18:22:16,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:16,636 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2024-11-16 18:22:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:16,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:16,643 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:16,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:22:16,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:16,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:16,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1543450038, now seen corresponding path program 1 times [2024-11-16 18:22:16,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:16,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766088246] [2024-11-16 18:22:16,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:16,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:16,873 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:16,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766088246] [2024-11-16 18:22:16,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766088246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:16,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:16,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:22:16,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935197485] [2024-11-16 18:22:16,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:16,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:22:16,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:16,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:22:16,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:22:16,878 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:16,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:16,933 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2024-11-16 18:22:16,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:22:16,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-16 18:22:16,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:16,935 INFO L225 Difference]: With dead ends: 209 [2024-11-16 18:22:16,935 INFO L226 Difference]: Without dead ends: 107 [2024-11-16 18:22:16,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:22:16,936 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:16,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-16 18:22:16,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-16 18:22:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.4270833333333333) internal successors, (137), 96 states have internal predecessors, (137), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:22:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 155 transitions. [2024-11-16 18:22:16,951 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 155 transitions. Word has length 100 [2024-11-16 18:22:16,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:16,954 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 155 transitions. [2024-11-16 18:22:16,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:16,955 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 155 transitions. [2024-11-16 18:22:16,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:16,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:16,956 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:16,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 18:22:16,958 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:16,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:16,958 INFO L85 PathProgramCache]: Analyzing trace with hash 631230059, now seen corresponding path program 1 times [2024-11-16 18:22:16,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:16,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896895638] [2024-11-16 18:22:16,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:16,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:17,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:17,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:17,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896895638] [2024-11-16 18:22:17,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896895638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:17,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:17,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:22:17,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170272480] [2024-11-16 18:22:17,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:17,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:22:17,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:17,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:22:17,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:22:17,142 INFO L87 Difference]: Start difference. First operand 107 states and 155 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:17,194 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-11-16 18:22:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:22:17,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-16 18:22:17,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:17,198 INFO L225 Difference]: With dead ends: 214 [2024-11-16 18:22:17,198 INFO L226 Difference]: Without dead ends: 110 [2024-11-16 18:22:17,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:22:17,199 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:17,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 421 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-16 18:22:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2024-11-16 18:22:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 98 states have (on average 1.4183673469387754) internal successors, (139), 98 states have internal predecessors, (139), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:22:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-16 18:22:17,212 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 100 [2024-11-16 18:22:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:17,212 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-16 18:22:17,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-16 18:22:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:17,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:17,214 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:17,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 18:22:17,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:17,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:17,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1920926902, now seen corresponding path program 1 times [2024-11-16 18:22:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709729007] [2024-11-16 18:22:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:17,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,376 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:17,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:17,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709729007] [2024-11-16 18:22:17,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709729007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:17,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:17,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:22:17,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278518074] [2024-11-16 18:22:17,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:17,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:22:17,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:17,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:22:17,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:22:17,378 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:17,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:17,413 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-11-16 18:22:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:22:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-16 18:22:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:17,416 INFO L225 Difference]: With dead ends: 218 [2024-11-16 18:22:17,416 INFO L226 Difference]: Without dead ends: 112 [2024-11-16 18:22:17,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:22:17,420 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:17,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:17,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-16 18:22:17,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-16 18:22:17,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 100 states have (on average 1.41) internal successors, (141), 100 states have internal predecessors, (141), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:22:17,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-16 18:22:17,430 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 100 [2024-11-16 18:22:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:17,431 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-16 18:22:17,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:17,431 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-16 18:22:17,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:17,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:17,432 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:17,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 18:22:17,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:17,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:17,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1892297751, now seen corresponding path program 1 times [2024-11-16 18:22:17,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:17,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841566118] [2024-11-16 18:22:17,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:17,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:17,634 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:17,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:17,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841566118] [2024-11-16 18:22:17,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841566118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:17,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:17,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:22:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627585708] [2024-11-16 18:22:17,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:17,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:22:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:17,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:22:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:22:17,638 INFO L87 Difference]: Start difference. First operand 111 states and 159 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:17,712 INFO L93 Difference]: Finished difference Result 309 states and 443 transitions. [2024-11-16 18:22:17,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:22:17,713 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-16 18:22:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:17,714 INFO L225 Difference]: With dead ends: 309 [2024-11-16 18:22:17,714 INFO L226 Difference]: Without dead ends: 201 [2024-11-16 18:22:17,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:22:17,715 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 113 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:17,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 690 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:17,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-16 18:22:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 197. [2024-11-16 18:22:17,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 180 states have (on average 1.4166666666666667) internal successors, (255), 181 states have internal predecessors, (255), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:22:17,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 283 transitions. [2024-11-16 18:22:17,735 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 283 transitions. Word has length 100 [2024-11-16 18:22:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:17,735 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 283 transitions. [2024-11-16 18:22:17,735 INFO L472 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, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:17,736 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 283 transitions. [2024-11-16 18:22:17,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:17,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:17,737 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:17,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 18:22:17,737 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:17,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:17,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1892135368, now seen corresponding path program 1 times [2024-11-16 18:22:17,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:17,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560860882] [2024-11-16 18:22:17,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:17,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,159 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:18,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:18,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560860882] [2024-11-16 18:22:18,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560860882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 18:22:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126065243] [2024-11-16 18:22:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:18,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:22:18,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:18,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:22:18,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:22:18,162 INFO L87 Difference]: Start difference. First operand 197 states and 283 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:18,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:18,366 INFO L93 Difference]: Finished difference Result 431 states and 619 transitions. [2024-11-16 18:22:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:22:18,367 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-16 18:22:18,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:18,369 INFO L225 Difference]: With dead ends: 431 [2024-11-16 18:22:18,369 INFO L226 Difference]: Without dead ends: 237 [2024-11-16 18:22:18,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:18,370 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 166 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:18,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 453 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-16 18:22:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2024-11-16 18:22:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 211 states have (on average 1.3981042654028435) internal successors, (295), 213 states have internal predecessors, (295), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-16 18:22:18,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 337 transitions. [2024-11-16 18:22:18,382 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 337 transitions. Word has length 100 [2024-11-16 18:22:18,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:18,382 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 337 transitions. [2024-11-16 18:22:18,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:18,383 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 337 transitions. [2024-11-16 18:22:18,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:18,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:18,384 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:18,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 18:22:18,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:18,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:18,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1959304504, now seen corresponding path program 1 times [2024-11-16 18:22:18,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:18,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462636015] [2024-11-16 18:22:18,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:18,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:18,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:18,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462636015] [2024-11-16 18:22:18,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462636015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:18,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:18,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:22:18,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201140509] [2024-11-16 18:22:18,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:18,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:22:18,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:18,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:22:18,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:22:18,782 INFO L87 Difference]: Start difference. First operand 236 states and 337 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:18,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:18,976 INFO L93 Difference]: Finished difference Result 452 states and 642 transitions. [2024-11-16 18:22:18,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:22:18,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 100 [2024-11-16 18:22:18,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:18,978 INFO L225 Difference]: With dead ends: 452 [2024-11-16 18:22:18,978 INFO L226 Difference]: Without dead ends: 252 [2024-11-16 18:22:18,979 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:22:18,979 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 291 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:18,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 563 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:22:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-11-16 18:22:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 248. [2024-11-16 18:22:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 220 states have (on average 1.3818181818181818) internal successors, (304), 222 states have internal predecessors, (304), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:22:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 350 transitions. [2024-11-16 18:22:18,990 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 350 transitions. Word has length 100 [2024-11-16 18:22:18,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:18,990 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 350 transitions. [2024-11-16 18:22:18,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 350 transitions. [2024-11-16 18:22:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:18,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:18,991 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:18,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 18:22:18,992 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:18,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1825128615, now seen corresponding path program 1 times [2024-11-16 18:22:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:18,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164669308] [2024-11-16 18:22:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:18,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:20,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:20,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:20,224 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:20,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:20,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164669308] [2024-11-16 18:22:20,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164669308] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:20,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:20,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:22:20,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279301036] [2024-11-16 18:22:20,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:20,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:22:20,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:20,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:22:20,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:22:20,227 INFO L87 Difference]: Start difference. First operand 248 states and 350 transitions. Second operand has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:21,678 INFO L93 Difference]: Finished difference Result 1255 states and 1775 transitions. [2024-11-16 18:22:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:22:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 100 [2024-11-16 18:22:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:21,682 INFO L225 Difference]: With dead ends: 1255 [2024-11-16 18:22:21,683 INFO L226 Difference]: Without dead ends: 1051 [2024-11-16 18:22:21,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=202, Invalid=500, Unknown=0, NotChecked=0, Total=702 [2024-11-16 18:22:21,686 INFO L432 NwaCegarLoop]: 296 mSDtfsCounter, 996 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1969 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:21,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1969 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 18:22:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-11-16 18:22:21,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 390. [2024-11-16 18:22:21,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 350 states have (on average 1.3914285714285715) internal successors, (487), 352 states have internal predecessors, (487), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 18:22:21,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 551 transitions. [2024-11-16 18:22:21,740 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 551 transitions. Word has length 100 [2024-11-16 18:22:21,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:21,741 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 551 transitions. [2024-11-16 18:22:21,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.833333333333333) internal successors, (58), 13 states have internal predecessors, (58), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:21,741 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 551 transitions. [2024-11-16 18:22:21,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:22:21,742 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:21,743 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:21,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 18:22:21,743 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:21,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:21,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1836444742, now seen corresponding path program 1 times [2024-11-16 18:22:21,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:21,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672767812] [2024-11-16 18:22:21,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:21,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:22,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:22,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672767812] [2024-11-16 18:22:22,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672767812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:22,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:22,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:22:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981326357] [2024-11-16 18:22:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:22,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:22:22,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:22,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:22:22,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:22:22,674 INFO L87 Difference]: Start difference. First operand 390 states and 551 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:23,415 INFO L93 Difference]: Finished difference Result 1164 states and 1640 transitions. [2024-11-16 18:22:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:22:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2024-11-16 18:22:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:23,422 INFO L225 Difference]: With dead ends: 1164 [2024-11-16 18:22:23,422 INFO L226 Difference]: Without dead ends: 818 [2024-11-16 18:22:23,426 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:22:23,426 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 520 mSDsluCounter, 1382 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:23,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1718 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:22:23,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-11-16 18:22:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 390. [2024-11-16 18:22:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 350 states have (on average 1.3914285714285715) internal successors, (487), 352 states have internal predecessors, (487), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 18:22:23,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 551 transitions. [2024-11-16 18:22:23,456 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 551 transitions. Word has length 100 [2024-11-16 18:22:23,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:23,456 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 551 transitions. [2024-11-16 18:22:23,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 551 transitions. [2024-11-16 18:22:23,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:22:23,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:23,457 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:23,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 18:22:23,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:23,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:23,458 INFO L85 PathProgramCache]: Analyzing trace with hash 495051404, now seen corresponding path program 1 times [2024-11-16 18:22:23,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:23,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279641463] [2024-11-16 18:22:23,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:23,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:23,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:23,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:23,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,568 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:23,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:23,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279641463] [2024-11-16 18:22:23,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279641463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:23,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:23,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:22:23,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625165052] [2024-11-16 18:22:23,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:23,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:22:23,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:23,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:22:23,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:22:23,570 INFO L87 Difference]: Start difference. First operand 390 states and 551 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:23,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:23,717 INFO L93 Difference]: Finished difference Result 954 states and 1341 transitions. [2024-11-16 18:22:23,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:22:23,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-16 18:22:23,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:23,719 INFO L225 Difference]: With dead ends: 954 [2024-11-16 18:22:23,719 INFO L226 Difference]: Without dead ends: 608 [2024-11-16 18:22:23,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 18:22:23,720 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 141 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:23,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 658 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:22:23,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-16 18:22:23,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 418. [2024-11-16 18:22:23,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 378 states have (on average 1.3888888888888888) internal successors, (525), 380 states have internal predecessors, (525), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 18:22:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 589 transitions. [2024-11-16 18:22:23,749 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 589 transitions. Word has length 101 [2024-11-16 18:22:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:23,749 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 589 transitions. [2024-11-16 18:22:23,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 589 transitions. [2024-11-16 18:22:23,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:22:23,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:23,750 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:23,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 18:22:23,751 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:23,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:23,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1498582774, now seen corresponding path program 1 times [2024-11-16 18:22:23,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:23,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361504729] [2024-11-16 18:22:23,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:23,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:23,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:23,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:23,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:23,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:23,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:23,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:23,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361504729] [2024-11-16 18:22:23,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361504729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:23,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:23,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:22:23,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700890747] [2024-11-16 18:22:23,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:23,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:22:23,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:23,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:22:23,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:22:23,820 INFO L87 Difference]: Start difference. First operand 418 states and 589 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:23,982 INFO L93 Difference]: Finished difference Result 970 states and 1356 transitions. [2024-11-16 18:22:23,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:22:23,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 101 [2024-11-16 18:22:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:23,984 INFO L225 Difference]: With dead ends: 970 [2024-11-16 18:22:23,984 INFO L226 Difference]: Without dead ends: 596 [2024-11-16 18:22:23,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:22:23,985 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 126 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:23,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 664 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:22:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-11-16 18:22:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 418. [2024-11-16 18:22:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 378 states have (on average 1.3835978835978835) internal successors, (523), 380 states have internal predecessors, (523), 32 states have call successors, (32), 7 states have call predecessors, (32), 7 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-16 18:22:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 587 transitions. [2024-11-16 18:22:24,014 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 587 transitions. Word has length 101 [2024-11-16 18:22:24,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:24,014 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 587 transitions. [2024-11-16 18:22:24,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 587 transitions. [2024-11-16 18:22:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:22:24,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:24,016 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:24,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 18:22:24,016 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:24,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:24,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1621232979, now seen corresponding path program 1 times [2024-11-16 18:22:24,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:24,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759414504] [2024-11-16 18:22:24,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:24,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:24,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:24,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:22:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:24,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759414504] [2024-11-16 18:22:24,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759414504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:24,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-16 18:22:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128803236] [2024-11-16 18:22:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:24,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:22:24,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:22:24,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:22:24,606 INFO L87 Difference]: Start difference. First operand 418 states and 587 transitions. Second operand has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:25,826 INFO L93 Difference]: Finished difference Result 1431 states and 2001 transitions. [2024-11-16 18:22:25,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 18:22:25,827 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 101 [2024-11-16 18:22:25,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:25,830 INFO L225 Difference]: With dead ends: 1431 [2024-11-16 18:22:25,830 INFO L226 Difference]: Without dead ends: 1057 [2024-11-16 18:22:25,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=1147, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 18:22:25,831 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 894 mSDsluCounter, 2600 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 2927 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:25,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 2927 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:22:25,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-16 18:22:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 422. [2024-11-16 18:22:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 384 states have (on average 1.3828125) internal successors, (531), 386 states have internal predecessors, (531), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 18:22:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 591 transitions. [2024-11-16 18:22:25,863 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 591 transitions. Word has length 101 [2024-11-16 18:22:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:25,863 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 591 transitions. [2024-11-16 18:22:25,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.769230769230769) internal successors, (62), 14 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 591 transitions. [2024-11-16 18:22:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 18:22:25,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:25,864 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:25,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 18:22:25,864 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:25,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:25,865 INFO L85 PathProgramCache]: Analyzing trace with hash -291837532, now seen corresponding path program 1 times [2024-11-16 18:22:25,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:25,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139142636] [2024-11-16 18:22:25,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:25,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139142636] [2024-11-16 18:22:26,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139142636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:22:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647057328] [2024-11-16 18:22:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:22:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:22:26,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:22:26,163 INFO L87 Difference]: Start difference. First operand 422 states and 591 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:27,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:27,069 INFO L93 Difference]: Finished difference Result 1258 states and 1751 transitions. [2024-11-16 18:22:27,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 18:22:27,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2024-11-16 18:22:27,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:27,072 INFO L225 Difference]: With dead ends: 1258 [2024-11-16 18:22:27,072 INFO L226 Difference]: Without dead ends: 876 [2024-11-16 18:22:27,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:22:27,074 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 480 mSDsluCounter, 2496 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 2776 SdHoareTripleChecker+Invalid, 1169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:27,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 2776 Invalid, 1169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:22:27,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2024-11-16 18:22:27,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 551. [2024-11-16 18:22:27,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 551 states, 504 states have (on average 1.3888888888888888) internal successors, (700), 507 states have internal predecessors, (700), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 774 transitions. [2024-11-16 18:22:27,114 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 774 transitions. Word has length 102 [2024-11-16 18:22:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:27,114 INFO L471 AbstractCegarLoop]: Abstraction has 551 states and 774 transitions. [2024-11-16 18:22:27,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:27,114 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 774 transitions. [2024-11-16 18:22:27,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 18:22:27,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:27,115 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:27,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 18:22:27,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:27,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1858512698, now seen corresponding path program 1 times [2024-11-16 18:22:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:27,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154779806] [2024-11-16 18:22:27,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:27,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:27,397 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:27,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:27,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154779806] [2024-11-16 18:22:27,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154779806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:27,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:27,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:22:27,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365686245] [2024-11-16 18:22:27,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:27,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:22:27,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:27,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:22:27,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:22:27,399 INFO L87 Difference]: Start difference. First operand 551 states and 774 transitions. Second operand has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:28,113 INFO L93 Difference]: Finished difference Result 1504 states and 2105 transitions. [2024-11-16 18:22:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 18:22:28,113 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2024-11-16 18:22:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:28,116 INFO L225 Difference]: With dead ends: 1504 [2024-11-16 18:22:28,116 INFO L226 Difference]: Without dead ends: 993 [2024-11-16 18:22:28,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:22:28,120 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 463 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:28,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 1806 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:22:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2024-11-16 18:22:28,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 577. [2024-11-16 18:22:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 530 states have (on average 1.4) internal successors, (742), 533 states have internal predecessors, (742), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 816 transitions. [2024-11-16 18:22:28,168 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 816 transitions. Word has length 102 [2024-11-16 18:22:28,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:28,168 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 816 transitions. [2024-11-16 18:22:28,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.615384615384615) internal successors, (60), 13 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:28,168 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 816 transitions. [2024-11-16 18:22:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 18:22:28,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:28,170 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:28,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 18:22:28,170 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:28,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1925920421, now seen corresponding path program 1 times [2024-11-16 18:22:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12299254] [2024-11-16 18:22:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:28,977 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:22:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12299254] [2024-11-16 18:22:28,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12299254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:28,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-16 18:22:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598071610] [2024-11-16 18:22:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 18:22:28,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 18:22:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:22:28,979 INFO L87 Difference]: Start difference. First operand 577 states and 816 transitions. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:30,865 INFO L93 Difference]: Finished difference Result 1304 states and 1826 transitions. [2024-11-16 18:22:30,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-16 18:22:30,866 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2024-11-16 18:22:30,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:30,868 INFO L225 Difference]: With dead ends: 1304 [2024-11-16 18:22:30,868 INFO L226 Difference]: Without dead ends: 767 [2024-11-16 18:22:30,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=507, Invalid=1845, Unknown=0, NotChecked=0, Total=2352 [2024-11-16 18:22:30,870 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 784 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:30,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1648 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 18:22:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2024-11-16 18:22:30,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 521. [2024-11-16 18:22:30,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 474 states have (on average 1.3670886075949367) internal successors, (648), 477 states have internal predecessors, (648), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 722 transitions. [2024-11-16 18:22:30,956 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 722 transitions. Word has length 102 [2024-11-16 18:22:30,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:30,956 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 722 transitions. [2024-11-16 18:22:30,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 15 states have internal predecessors, (63), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:30,956 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 722 transitions. [2024-11-16 18:22:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 18:22:30,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:30,961 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:30,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 18:22:30,961 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:30,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1774111447, now seen corresponding path program 1 times [2024-11-16 18:22:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:30,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392377970] [2024-11-16 18:22:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:30,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:31,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:31,988 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:31,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:31,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392377970] [2024-11-16 18:22:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392377970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:22:31,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394556937] [2024-11-16 18:22:31,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:31,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:22:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:22:31,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:22:31,992 INFO L87 Difference]: Start difference. First operand 521 states and 722 transitions. Second operand has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:32,802 INFO L93 Difference]: Finished difference Result 1983 states and 2745 transitions. [2024-11-16 18:22:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-16 18:22:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 102 [2024-11-16 18:22:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:32,806 INFO L225 Difference]: With dead ends: 1983 [2024-11-16 18:22:32,806 INFO L226 Difference]: Without dead ends: 1502 [2024-11-16 18:22:32,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=215, Invalid=715, Unknown=0, NotChecked=0, Total=930 [2024-11-16 18:22:32,808 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 718 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1627 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:32,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1627 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:22:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2024-11-16 18:22:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 639. [2024-11-16 18:22:32,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 580 states have (on average 1.353448275862069) internal successors, (785), 583 states have internal predecessors, (785), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 18:22:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 877 transitions. [2024-11-16 18:22:32,865 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 877 transitions. Word has length 102 [2024-11-16 18:22:32,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:32,865 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 877 transitions. [2024-11-16 18:22:32,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.0) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:32,865 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 877 transitions. [2024-11-16 18:22:32,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 18:22:32,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:32,866 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:32,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 18:22:32,867 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:32,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:32,867 INFO L85 PathProgramCache]: Analyzing trace with hash 510752008, now seen corresponding path program 1 times [2024-11-16 18:22:32,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:32,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872149951] [2024-11-16 18:22:32,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:32,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:33,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,124 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:33,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:33,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872149951] [2024-11-16 18:22:33,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872149951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:33,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:33,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:22:33,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246363815] [2024-11-16 18:22:33,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:33,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:22:33,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:33,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:22:33,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:22:33,126 INFO L87 Difference]: Start difference. First operand 639 states and 877 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:33,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:33,289 INFO L93 Difference]: Finished difference Result 1482 states and 2035 transitions. [2024-11-16 18:22:33,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:22:33,289 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 102 [2024-11-16 18:22:33,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:33,291 INFO L225 Difference]: With dead ends: 1482 [2024-11-16 18:22:33,292 INFO L226 Difference]: Without dead ends: 883 [2024-11-16 18:22:33,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:33,293 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 357 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:33,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 728 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:22:33,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-11-16 18:22:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 636. [2024-11-16 18:22:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 589 states have (on average 1.3599320882852293) internal successors, (801), 592 states have internal predecessors, (801), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 875 transitions. [2024-11-16 18:22:33,344 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 875 transitions. Word has length 102 [2024-11-16 18:22:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:33,345 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 875 transitions. [2024-11-16 18:22:33,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 875 transitions. [2024-11-16 18:22:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 18:22:33,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:33,346 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:33,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 18:22:33,346 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:33,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:33,347 INFO L85 PathProgramCache]: Analyzing trace with hash 429553970, now seen corresponding path program 1 times [2024-11-16 18:22:33,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:33,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555405898] [2024-11-16 18:22:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:33,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:33,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:33,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:33,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:33,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:33,546 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:33,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:33,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555405898] [2024-11-16 18:22:33,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555405898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:33,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:33,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:22:33,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802442317] [2024-11-16 18:22:33,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:33,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:22:33,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:33,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:22:33,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:22:33,548 INFO L87 Difference]: Start difference. First operand 636 states and 875 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:34,130 INFO L93 Difference]: Finished difference Result 1607 states and 2194 transitions. [2024-11-16 18:22:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 18:22:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2024-11-16 18:22:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:34,133 INFO L225 Difference]: With dead ends: 1607 [2024-11-16 18:22:34,134 INFO L226 Difference]: Without dead ends: 1005 [2024-11-16 18:22:34,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2024-11-16 18:22:34,135 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 414 mSDsluCounter, 1740 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1948 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:34,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1948 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:22:34,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states. [2024-11-16 18:22:34,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 671. [2024-11-16 18:22:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 671 states, 624 states have (on average 1.3621794871794872) internal successors, (850), 627 states have internal predecessors, (850), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:34,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 924 transitions. [2024-11-16 18:22:34,182 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 924 transitions. Word has length 103 [2024-11-16 18:22:34,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:34,182 INFO L471 AbstractCegarLoop]: Abstraction has 671 states and 924 transitions. [2024-11-16 18:22:34,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:34,183 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 924 transitions. [2024-11-16 18:22:34,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 18:22:34,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:34,184 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:34,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 18:22:34,184 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:34,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:34,184 INFO L85 PathProgramCache]: Analyzing trace with hash 971107954, now seen corresponding path program 1 times [2024-11-16 18:22:34,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:34,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945763735] [2024-11-16 18:22:34,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:34,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:34,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:34,384 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:34,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:34,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945763735] [2024-11-16 18:22:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945763735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:34,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:34,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:22:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902257520] [2024-11-16 18:22:34,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:34,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:22:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:34,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:22:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:22:34,387 INFO L87 Difference]: Start difference. First operand 671 states and 924 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:35,026 INFO L93 Difference]: Finished difference Result 2346 states and 3227 transitions. [2024-11-16 18:22:35,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 18:22:35,027 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 103 [2024-11-16 18:22:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:35,031 INFO L225 Difference]: With dead ends: 2346 [2024-11-16 18:22:35,031 INFO L226 Difference]: Without dead ends: 1709 [2024-11-16 18:22:35,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:22:35,033 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 432 mSDsluCounter, 1476 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:35,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1666 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:22:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states. [2024-11-16 18:22:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 788. [2024-11-16 18:22:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 741 states have (on average 1.377867746288799) internal successors, (1021), 744 states have internal predecessors, (1021), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1095 transitions. [2024-11-16 18:22:35,122 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1095 transitions. Word has length 103 [2024-11-16 18:22:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:35,122 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1095 transitions. [2024-11-16 18:22:35,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:35,123 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1095 transitions. [2024-11-16 18:22:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-16 18:22:35,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:35,124 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:35,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 18:22:35,124 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:35,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:35,124 INFO L85 PathProgramCache]: Analyzing trace with hash 460573777, now seen corresponding path program 1 times [2024-11-16 18:22:35,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:35,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013301043] [2024-11-16 18:22:35,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:35,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:35,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:35,696 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:35,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:35,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013301043] [2024-11-16 18:22:35,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013301043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:35,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:35,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:22:35,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647251610] [2024-11-16 18:22:35,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:35,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:22:35,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:35,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:22:35,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:22:35,698 INFO L87 Difference]: Start difference. First operand 788 states and 1095 transitions. Second operand has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:36,877 INFO L93 Difference]: Finished difference Result 2285 states and 3164 transitions. [2024-11-16 18:22:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 18:22:36,878 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 103 [2024-11-16 18:22:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:36,884 INFO L225 Difference]: With dead ends: 2285 [2024-11-16 18:22:36,885 INFO L226 Difference]: Without dead ends: 1537 [2024-11-16 18:22:36,887 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=449, Unknown=0, NotChecked=0, Total=600 [2024-11-16 18:22:36,889 INFO L432 NwaCegarLoop]: 274 mSDtfsCounter, 948 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:36,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1826 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 18:22:36,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2024-11-16 18:22:36,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 811. [2024-11-16 18:22:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 764 states have (on average 1.3795811518324608) internal successors, (1054), 767 states have internal predecessors, (1054), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1128 transitions. [2024-11-16 18:22:36,954 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1128 transitions. Word has length 103 [2024-11-16 18:22:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:36,954 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1128 transitions. [2024-11-16 18:22:36,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.083333333333333) internal successors, (61), 13 states have internal predecessors, (61), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1128 transitions. [2024-11-16 18:22:36,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 18:22:36,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:36,956 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:36,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 18:22:36,956 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:36,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:36,957 INFO L85 PathProgramCache]: Analyzing trace with hash 819327850, now seen corresponding path program 1 times [2024-11-16 18:22:36,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:36,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578596513] [2024-11-16 18:22:36,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:36,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:37,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:37,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:37,405 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:37,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:37,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578596513] [2024-11-16 18:22:37,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578596513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:37,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:37,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:22:37,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226440532] [2024-11-16 18:22:37,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:37,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:22:37,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:37,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:22:37,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:37,407 INFO L87 Difference]: Start difference. First operand 811 states and 1128 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:37,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:37,909 INFO L93 Difference]: Finished difference Result 2198 states and 3045 transitions. [2024-11-16 18:22:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:22:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2024-11-16 18:22:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:37,913 INFO L225 Difference]: With dead ends: 2198 [2024-11-16 18:22:37,913 INFO L226 Difference]: Without dead ends: 1427 [2024-11-16 18:22:37,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:22:37,915 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 820 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:37,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 761 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:22:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-16 18:22:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 812. [2024-11-16 18:22:37,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 765 states have (on average 1.3790849673202614) internal successors, (1055), 768 states have internal predecessors, (1055), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:37,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1129 transitions. [2024-11-16 18:22:37,973 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1129 transitions. Word has length 104 [2024-11-16 18:22:37,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:37,973 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1129 transitions. [2024-11-16 18:22:37,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 9 states have internal predecessors, (62), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1129 transitions. [2024-11-16 18:22:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 18:22:37,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:37,975 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:37,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 18:22:37,975 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:37,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:37,975 INFO L85 PathProgramCache]: Analyzing trace with hash -638075173, now seen corresponding path program 1 times [2024-11-16 18:22:37,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:37,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671193199] [2024-11-16 18:22:37,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:37,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:38,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:38,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:38,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:38,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671193199] [2024-11-16 18:22:38,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671193199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:38,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:38,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:22:38,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121257221] [2024-11-16 18:22:38,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:38,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:22:38,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:38,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:22:38,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:38,095 INFO L87 Difference]: Start difference. First operand 812 states and 1129 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:38,392 INFO L93 Difference]: Finished difference Result 1714 states and 2374 transitions. [2024-11-16 18:22:38,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:22:38,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-16 18:22:38,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:38,395 INFO L225 Difference]: With dead ends: 1714 [2024-11-16 18:22:38,395 INFO L226 Difference]: Without dead ends: 936 [2024-11-16 18:22:38,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:22:38,398 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 135 mSDsluCounter, 1066 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:38,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1255 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:38,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2024-11-16 18:22:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 796. [2024-11-16 18:22:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 749 states have (on average 1.3751668891855808) internal successors, (1030), 752 states have internal predecessors, (1030), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:38,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1104 transitions. [2024-11-16 18:22:38,456 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1104 transitions. Word has length 104 [2024-11-16 18:22:38,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:38,456 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1104 transitions. [2024-11-16 18:22:38,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:38,456 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1104 transitions. [2024-11-16 18:22:38,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 18:22:38,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:38,457 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:38,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 18:22:38,457 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:38,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:38,458 INFO L85 PathProgramCache]: Analyzing trace with hash 834073021, now seen corresponding path program 1 times [2024-11-16 18:22:38,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:38,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926716695] [2024-11-16 18:22:38,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:38,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:38,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:38,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:38,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926716695] [2024-11-16 18:22:38,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926716695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:38,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:38,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:22:38,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184150468] [2024-11-16 18:22:38,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:38,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:22:38,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:38,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:22:38,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:38,593 INFO L87 Difference]: Start difference. First operand 796 states and 1104 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:38,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:38,903 INFO L93 Difference]: Finished difference Result 1829 states and 2531 transitions. [2024-11-16 18:22:38,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:22:38,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 104 [2024-11-16 18:22:38,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:38,906 INFO L225 Difference]: With dead ends: 1829 [2024-11-16 18:22:38,907 INFO L226 Difference]: Without dead ends: 1073 [2024-11-16 18:22:38,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:22:38,908 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 133 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:38,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1543 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:38,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-16 18:22:38,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 818. [2024-11-16 18:22:38,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 771 states have (on average 1.3748378728923476) internal successors, (1060), 774 states have internal predecessors, (1060), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:38,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1134 transitions. [2024-11-16 18:22:38,967 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1134 transitions. Word has length 104 [2024-11-16 18:22:38,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:38,967 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1134 transitions. [2024-11-16 18:22:38,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1134 transitions. [2024-11-16 18:22:38,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-16 18:22:38,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:38,969 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:38,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 18:22:38,969 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:38,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:38,969 INFO L85 PathProgramCache]: Analyzing trace with hash 323538844, now seen corresponding path program 1 times [2024-11-16 18:22:38,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:38,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381163457] [2024-11-16 18:22:38,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:38,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,192 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:22:39,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381163457] [2024-11-16 18:22:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381163457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:39,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:39,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:22:39,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437264705] [2024-11-16 18:22:39,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:39,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:22:39,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:39,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:22:39,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:22:39,194 INFO L87 Difference]: Start difference. First operand 818 states and 1134 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:39,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:39,688 INFO L93 Difference]: Finished difference Result 1761 states and 2431 transitions. [2024-11-16 18:22:39,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:22:39,689 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 104 [2024-11-16 18:22:39,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:39,692 INFO L225 Difference]: With dead ends: 1761 [2024-11-16 18:22:39,692 INFO L226 Difference]: Without dead ends: 983 [2024-11-16 18:22:39,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-11-16 18:22:39,694 INFO L432 NwaCegarLoop]: 223 mSDtfsCounter, 707 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 1243 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:39,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 1243 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:22:39,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-16 18:22:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 750. [2024-11-16 18:22:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 703 states have (on average 1.3698435277382646) internal successors, (963), 706 states have internal predecessors, (963), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1037 transitions. [2024-11-16 18:22:39,787 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1037 transitions. Word has length 104 [2024-11-16 18:22:39,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:39,788 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1037 transitions. [2024-11-16 18:22:39,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 3 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1037 transitions. [2024-11-16 18:22:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:22:39,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:39,789 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:39,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 18:22:39,789 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:39,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:39,790 INFO L85 PathProgramCache]: Analyzing trace with hash 227357205, now seen corresponding path program 1 times [2024-11-16 18:22:39,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:39,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573039285] [2024-11-16 18:22:39,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:39,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:39,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:40,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,009 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:40,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:40,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573039285] [2024-11-16 18:22:40,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573039285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:40,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:40,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:22:40,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089262880] [2024-11-16 18:22:40,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:40,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:22:40,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:40,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:22:40,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:40,011 INFO L87 Difference]: Start difference. First operand 750 states and 1037 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:40,427 INFO L93 Difference]: Finished difference Result 2104 states and 2888 transitions. [2024-11-16 18:22:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:22:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-16 18:22:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:40,432 INFO L225 Difference]: With dead ends: 2104 [2024-11-16 18:22:40,432 INFO L226 Difference]: Without dead ends: 1394 [2024-11-16 18:22:40,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-16 18:22:40,434 INFO L432 NwaCegarLoop]: 303 mSDtfsCounter, 402 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:40,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 1439 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-16 18:22:40,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 769. [2024-11-16 18:22:40,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 722 states have (on average 1.3642659279778393) internal successors, (985), 725 states have internal predecessors, (985), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1059 transitions. [2024-11-16 18:22:40,502 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1059 transitions. Word has length 105 [2024-11-16 18:22:40,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:40,502 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1059 transitions. [2024-11-16 18:22:40,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1059 transitions. [2024-11-16 18:22:40,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:22:40,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:40,504 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:40,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 18:22:40,504 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:40,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:40,504 INFO L85 PathProgramCache]: Analyzing trace with hash 258377012, now seen corresponding path program 1 times [2024-11-16 18:22:40,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:40,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22314725] [2024-11-16 18:22:40,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:40,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:40,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22314725] [2024-11-16 18:22:40,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22314725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:40,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:40,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 18:22:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843762097] [2024-11-16 18:22:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:40,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:22:40,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:40,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:22:40,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:22:40,663 INFO L87 Difference]: Start difference. First operand 769 states and 1059 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:40,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:40,913 INFO L93 Difference]: Finished difference Result 1764 states and 2425 transitions. [2024-11-16 18:22:40,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:22:40,915 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-16 18:22:40,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:40,919 INFO L225 Difference]: With dead ends: 1764 [2024-11-16 18:22:40,919 INFO L226 Difference]: Without dead ends: 1035 [2024-11-16 18:22:40,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:22:40,920 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 120 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:40,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 663 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:22:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2024-11-16 18:22:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 751. [2024-11-16 18:22:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 704 states have (on average 1.3494318181818181) internal successors, (950), 707 states have internal predecessors, (950), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1024 transitions. [2024-11-16 18:22:40,983 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1024 transitions. Word has length 105 [2024-11-16 18:22:40,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:40,984 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1024 transitions. [2024-11-16 18:22:40,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1024 transitions. [2024-11-16 18:22:40,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:22:40,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:40,985 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:40,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 18:22:40,985 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:40,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:40,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1334175463, now seen corresponding path program 1 times [2024-11-16 18:22:40,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:40,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329601694] [2024-11-16 18:22:40,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:40,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:41,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:41,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329601694] [2024-11-16 18:22:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329601694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:41,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:22:41,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997781768] [2024-11-16 18:22:41,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:41,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:22:41,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:41,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:22:41,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:22:41,187 INFO L87 Difference]: Start difference. First operand 751 states and 1024 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:41,875 INFO L93 Difference]: Finished difference Result 1864 states and 2523 transitions. [2024-11-16 18:22:41,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:22:41,875 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 105 [2024-11-16 18:22:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:41,879 INFO L225 Difference]: With dead ends: 1864 [2024-11-16 18:22:41,879 INFO L226 Difference]: Without dead ends: 1153 [2024-11-16 18:22:41,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2024-11-16 18:22:41,880 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 339 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 2039 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:41,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 2039 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 18:22:41,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-16 18:22:41,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 769. [2024-11-16 18:22:41,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 722 states have (on average 1.3518005540166205) internal successors, (976), 725 states have internal predecessors, (976), 37 states have call successors, (37), 9 states have call predecessors, (37), 9 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-16 18:22:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1050 transitions. [2024-11-16 18:22:41,943 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1050 transitions. Word has length 105 [2024-11-16 18:22:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:41,943 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1050 transitions. [2024-11-16 18:22:41,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1050 transitions. [2024-11-16 18:22:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-16 18:22:41,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:41,944 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:41,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 18:22:41,945 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:41,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1078377831, now seen corresponding path program 1 times [2024-11-16 18:22:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942559394] [2024-11-16 18:22:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:41,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:42,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,093 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:42,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:42,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942559394] [2024-11-16 18:22:42,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942559394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:42,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:42,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:22:42,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626984615] [2024-11-16 18:22:42,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:42,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:22:42,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:42,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:22:42,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:22:42,094 INFO L87 Difference]: Start difference. First operand 769 states and 1050 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:42,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:42,280 INFO L93 Difference]: Finished difference Result 1670 states and 2276 transitions. [2024-11-16 18:22:42,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:22:42,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 105 [2024-11-16 18:22:42,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:42,283 INFO L225 Difference]: With dead ends: 1670 [2024-11-16 18:22:42,283 INFO L226 Difference]: Without dead ends: 941 [2024-11-16 18:22:42,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:22:42,284 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 122 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:42,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 554 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:22:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-16 18:22:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 938. [2024-11-16 18:22:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 938 states, 879 states have (on average 1.348122866894198) internal successors, (1185), 882 states have internal predecessors, (1185), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 18:22:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 938 states to 938 states and 1277 transitions. [2024-11-16 18:22:42,368 INFO L78 Accepts]: Start accepts. Automaton has 938 states and 1277 transitions. Word has length 105 [2024-11-16 18:22:42,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:42,369 INFO L471 AbstractCegarLoop]: Abstraction has 938 states and 1277 transitions. [2024-11-16 18:22:42,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:42,369 INFO L276 IsEmpty]: Start isEmpty. Operand 938 states and 1277 transitions. [2024-11-16 18:22:42,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:22:42,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:42,370 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:42,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 18:22:42,370 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:42,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:42,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1653062297, now seen corresponding path program 1 times [2024-11-16 18:22:42,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:42,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944455618] [2024-11-16 18:22:42,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:42,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:42,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:42,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:42,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944455618] [2024-11-16 18:22:42,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944455618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:42,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:42,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:22:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214822231] [2024-11-16 18:22:42,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:42,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:22:42,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:42,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:22:42,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:22:42,754 INFO L87 Difference]: Start difference. First operand 938 states and 1277 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:43,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:43,352 INFO L93 Difference]: Finished difference Result 2174 states and 2962 transitions. [2024-11-16 18:22:43,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 18:22:43,353 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 106 [2024-11-16 18:22:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:43,357 INFO L225 Difference]: With dead ends: 2174 [2024-11-16 18:22:43,357 INFO L226 Difference]: Without dead ends: 1445 [2024-11-16 18:22:43,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:22:43,359 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1004 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:43,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 846 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:22:43,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-16 18:22:43,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 972. [2024-11-16 18:22:43,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 913 states have (on average 1.3472070098576123) internal successors, (1230), 916 states have internal predecessors, (1230), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 18:22:43,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1322 transitions. [2024-11-16 18:22:43,448 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1322 transitions. Word has length 106 [2024-11-16 18:22:43,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:43,448 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1322 transitions. [2024-11-16 18:22:43,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-16 18:22:43,448 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1322 transitions. [2024-11-16 18:22:43,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:22:43,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:43,449 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:43,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 18:22:43,449 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:43,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:43,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1656799381, now seen corresponding path program 1 times [2024-11-16 18:22:43,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:43,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167088874] [2024-11-16 18:22:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:43,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:43,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:43,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167088874] [2024-11-16 18:22:43,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167088874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:43,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:43,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:22:43,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372093456] [2024-11-16 18:22:43,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:43,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:22:43,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:43,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:22:43,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:22:43,541 INFO L87 Difference]: Start difference. First operand 972 states and 1322 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:43,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:43,642 INFO L93 Difference]: Finished difference Result 1919 states and 2609 transitions. [2024-11-16 18:22:43,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:22:43,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2024-11-16 18:22:43,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:43,650 INFO L225 Difference]: With dead ends: 1919 [2024-11-16 18:22:43,650 INFO L226 Difference]: Without dead ends: 987 [2024-11-16 18:22:43,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:22:43,651 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:43,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 559 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:43,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-16 18:22:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2024-11-16 18:22:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 928 states have (on average 1.3415948275862069) internal successors, (1245), 931 states have internal predecessors, (1245), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 18:22:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1337 transitions. [2024-11-16 18:22:43,735 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1337 transitions. Word has length 106 [2024-11-16 18:22:43,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:43,736 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1337 transitions. [2024-11-16 18:22:43,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1337 transitions. [2024-11-16 18:22:43,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:22:43,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:43,738 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:43,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 18:22:43,738 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:43,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:43,738 INFO L85 PathProgramCache]: Analyzing trace with hash 66451676, now seen corresponding path program 1 times [2024-11-16 18:22:43,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:43,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498376666] [2024-11-16 18:22:43,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:43,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:43,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:43,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:43,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498376666] [2024-11-16 18:22:43,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498376666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:43,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:43,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:22:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268987743] [2024-11-16 18:22:43,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:43,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:22:43,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:22:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:22:43,826 INFO L87 Difference]: Start difference. First operand 987 states and 1337 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:43,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:43,969 INFO L93 Difference]: Finished difference Result 2005 states and 2723 transitions. [2024-11-16 18:22:43,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:22:43,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2024-11-16 18:22:43,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:43,973 INFO L225 Difference]: With dead ends: 2005 [2024-11-16 18:22:43,973 INFO L226 Difference]: Without dead ends: 1058 [2024-11-16 18:22:43,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 18:22:43,975 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 29 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:43,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 400 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-16 18:22:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 956. [2024-11-16 18:22:44,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 897 states have (on average 1.3400222965440356) internal successors, (1202), 900 states have internal predecessors, (1202), 46 states have call successors, (46), 12 states have call predecessors, (46), 12 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-16 18:22:44,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1294 transitions. [2024-11-16 18:22:44,114 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1294 transitions. Word has length 106 [2024-11-16 18:22:44,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:44,114 INFO L471 AbstractCegarLoop]: Abstraction has 956 states and 1294 transitions. [2024-11-16 18:22:44,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:44,114 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1294 transitions. [2024-11-16 18:22:44,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:22:44,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:44,115 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:44,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 18:22:44,116 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:44,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:44,116 INFO L85 PathProgramCache]: Analyzing trace with hash -2117225251, now seen corresponding path program 1 times [2024-11-16 18:22:44,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:44,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093206652] [2024-11-16 18:22:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:44,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:44,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:44,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:44,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:44,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,463 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:22:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093206652] [2024-11-16 18:22:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093206652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:22:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467548017] [2024-11-16 18:22:44,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:44,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:22:44,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:22:44,465 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:22:44,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:22:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:44,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-16 18:22:44,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:22:44,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-16 18:22:44,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:22:45,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-16 18:22:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:22:45,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:22:45,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-16 18:22:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-16 18:22:45,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467548017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 18:22:45,359 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 18:22:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 25 [2024-11-16 18:22:45,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477242645] [2024-11-16 18:22:45,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 18:22:45,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 18:22:45,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:45,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 18:22:45,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2024-11-16 18:22:45,362 INFO L87 Difference]: Start difference. First operand 956 states and 1294 transitions. Second operand has 25 states, 22 states have (on average 5.954545454545454) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-16 18:22:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:46,051 INFO L93 Difference]: Finished difference Result 1906 states and 2564 transitions. [2024-11-16 18:22:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:22:46,051 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 5.954545454545454) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 9 states have call successors, (27) Word has length 106 [2024-11-16 18:22:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:46,054 INFO L225 Difference]: With dead ends: 1906 [2024-11-16 18:22:46,054 INFO L226 Difference]: Without dead ends: 1160 [2024-11-16 18:22:46,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=292, Invalid=1040, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 18:22:46,056 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 649 mSDsluCounter, 2314 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:46,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2500 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:22:46,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-16 18:22:46,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 971. [2024-11-16 18:22:46,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 908 states have (on average 1.3359030837004404) internal successors, (1213), 910 states have internal predecessors, (1213), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 46 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-16 18:22:46,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1309 transitions. [2024-11-16 18:22:46,168 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1309 transitions. Word has length 106 [2024-11-16 18:22:46,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:46,168 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1309 transitions. [2024-11-16 18:22:46,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 5.954545454545454) internal successors, (131), 23 states have internal predecessors, (131), 9 states have call successors, (27), 4 states have call predecessors, (27), 6 states have return successors, (27), 7 states have call predecessors, (27), 9 states have call successors, (27) [2024-11-16 18:22:46,169 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1309 transitions. [2024-11-16 18:22:46,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-16 18:22:46,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:46,169 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:46,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:22:46,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-16 18:22:46,374 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:46,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:46,374 INFO L85 PathProgramCache]: Analyzing trace with hash 311722000, now seen corresponding path program 1 times [2024-11-16 18:22:46,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:46,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423168948] [2024-11-16 18:22:46,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:46,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:46,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:46,539 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:46,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:46,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423168948] [2024-11-16 18:22:46,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423168948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:46,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:22:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745774648] [2024-11-16 18:22:46,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:46,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:22:46,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:46,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:22:46,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:22:46,540 INFO L87 Difference]: Start difference. First operand 971 states and 1309 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:47,164 INFO L93 Difference]: Finished difference Result 3093 states and 4181 transitions. [2024-11-16 18:22:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:22:47,165 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 106 [2024-11-16 18:22:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:47,169 INFO L225 Difference]: With dead ends: 3093 [2024-11-16 18:22:47,169 INFO L226 Difference]: Without dead ends: 2145 [2024-11-16 18:22:47,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-16 18:22:47,170 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 306 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:47,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1867 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 18:22:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-11-16 18:22:47,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 1638. [2024-11-16 18:22:47,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1537 states have (on average 1.335718932986337) internal successors, (2053), 1541 states have internal predecessors, (2053), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 18:22:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2209 transitions. [2024-11-16 18:22:47,324 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2209 transitions. Word has length 106 [2024-11-16 18:22:47,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:47,324 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2209 transitions. [2024-11-16 18:22:47,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2209 transitions. [2024-11-16 18:22:47,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:22:47,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:47,325 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:47,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 18:22:47,325 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:47,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:47,326 INFO L85 PathProgramCache]: Analyzing trace with hash 743278891, now seen corresponding path program 1 times [2024-11-16 18:22:47,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:47,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975761421] [2024-11-16 18:22:47,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:47,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:47,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:47,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:47,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:47,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975761421] [2024-11-16 18:22:47,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975761421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:47,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:47,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:22:47,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703061457] [2024-11-16 18:22:47,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:47,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:22:47,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:47,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:22:47,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:47,461 INFO L87 Difference]: Start difference. First operand 1638 states and 2209 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:47,986 INFO L93 Difference]: Finished difference Result 3237 states and 4358 transitions. [2024-11-16 18:22:47,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 18:22:47,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 107 [2024-11-16 18:22:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:47,994 INFO L225 Difference]: With dead ends: 3237 [2024-11-16 18:22:47,994 INFO L226 Difference]: Without dead ends: 2391 [2024-11-16 18:22:47,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:22:47,997 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 141 mSDsluCounter, 1453 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:47,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1708 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 18:22:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2024-11-16 18:22:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 1616. [2024-11-16 18:22:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1515 states have (on average 1.335973597359736) internal successors, (2024), 1519 states have internal predecessors, (2024), 78 states have call successors, (78), 22 states have call predecessors, (78), 22 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-16 18:22:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2180 transitions. [2024-11-16 18:22:48,154 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2180 transitions. Word has length 107 [2024-11-16 18:22:48,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:48,154 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2180 transitions. [2024-11-16 18:22:48,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:48,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2180 transitions. [2024-11-16 18:22:48,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 18:22:48,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:48,155 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:48,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 18:22:48,155 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:48,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1074948746, now seen corresponding path program 1 times [2024-11-16 18:22:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:48,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530402547] [2024-11-16 18:22:48,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:48,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:48,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:48,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:48,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530402547] [2024-11-16 18:22:48,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530402547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:48,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:48,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:22:48,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948966634] [2024-11-16 18:22:48,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:48,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:22:48,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:48,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:22:48,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:48,316 INFO L87 Difference]: Start difference. First operand 1616 states and 2180 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:48,852 INFO L93 Difference]: Finished difference Result 3604 states and 4841 transitions. [2024-11-16 18:22:48,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 18:22:48,852 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 107 [2024-11-16 18:22:48,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:48,856 INFO L225 Difference]: With dead ends: 3604 [2024-11-16 18:22:48,856 INFO L226 Difference]: Without dead ends: 2027 [2024-11-16 18:22:48,857 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:22:48,857 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 290 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:48,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 1153 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2024-11-16 18:22:48,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1393. [2024-11-16 18:22:48,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1304 states have (on average 1.3312883435582823) internal successors, (1736), 1306 states have internal predecessors, (1736), 68 states have call successors, (68), 20 states have call predecessors, (68), 20 states have return successors, (68), 66 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-16 18:22:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1872 transitions. [2024-11-16 18:22:48,992 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1872 transitions. Word has length 107 [2024-11-16 18:22:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:48,992 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1872 transitions. [2024-11-16 18:22:48,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:48,993 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1872 transitions. [2024-11-16 18:22:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:22:48,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:48,993 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:48,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 18:22:48,994 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:48,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1274015133, now seen corresponding path program 1 times [2024-11-16 18:22:48,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:48,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337885855] [2024-11-16 18:22:48,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:48,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:49,231 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:49,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337885855] [2024-11-16 18:22:49,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337885855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:49,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:49,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 18:22:49,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540223527] [2024-11-16 18:22:49,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:49,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 18:22:49,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 18:22:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 18:22:49,232 INFO L87 Difference]: Start difference. First operand 1393 states and 1872 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:49,574 INFO L93 Difference]: Finished difference Result 2310 states and 3115 transitions. [2024-11-16 18:22:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:22:49,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 108 [2024-11-16 18:22:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:49,578 INFO L225 Difference]: With dead ends: 2310 [2024-11-16 18:22:49,578 INFO L226 Difference]: Without dead ends: 972 [2024-11-16 18:22:49,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:22:49,584 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 269 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:49,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 649 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2024-11-16 18:22:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 949. [2024-11-16 18:22:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 878 states have (on average 1.3200455580865604) internal successors, (1159), 878 states have internal predecessors, (1159), 54 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-16 18:22:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1267 transitions. [2024-11-16 18:22:49,747 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1267 transitions. Word has length 108 [2024-11-16 18:22:49,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:49,747 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1267 transitions. [2024-11-16 18:22:49,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:49,747 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1267 transitions. [2024-11-16 18:22:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:22:49,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:49,748 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:49,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-16 18:22:49,748 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:49,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:49,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1817316289, now seen corresponding path program 1 times [2024-11-16 18:22:49,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:49,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061717942] [2024-11-16 18:22:49,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:49,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:50,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:50,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061717942] [2024-11-16 18:22:50,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061717942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:50,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:50,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 18:22:50,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766126155] [2024-11-16 18:22:50,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:50,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 18:22:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 18:22:50,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:22:50,080 INFO L87 Difference]: Start difference. First operand 949 states and 1267 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:50,535 INFO L93 Difference]: Finished difference Result 1835 states and 2452 transitions. [2024-11-16 18:22:50,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 18:22:50,535 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 108 [2024-11-16 18:22:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:50,537 INFO L225 Difference]: With dead ends: 1835 [2024-11-16 18:22:50,537 INFO L226 Difference]: Without dead ends: 941 [2024-11-16 18:22:50,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:22:50,538 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 255 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:50,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 791 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:50,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2024-11-16 18:22:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 560. [2024-11-16 18:22:50,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 512 states have (on average 1.310546875) internal successors, (671), 512 states have internal predecessors, (671), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:22:50,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 743 transitions. [2024-11-16 18:22:50,608 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 743 transitions. Word has length 108 [2024-11-16 18:22:50,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:50,608 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 743 transitions. [2024-11-16 18:22:50,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:50,609 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 743 transitions. [2024-11-16 18:22:50,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:22:50,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:50,609 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:50,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-16 18:22:50,609 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:50,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash -396697293, now seen corresponding path program 1 times [2024-11-16 18:22:50,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:50,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85366410] [2024-11-16 18:22:50,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:50,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:50,660 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:50,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:50,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85366410] [2024-11-16 18:22:50,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85366410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:50,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:50,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 18:22:50,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318481383] [2024-11-16 18:22:50,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:50,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 18:22:50,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:50,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 18:22:50,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:22:50,662 INFO L87 Difference]: Start difference. First operand 560 states and 743 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:50,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:50,741 INFO L93 Difference]: Finished difference Result 1068 states and 1422 transitions. [2024-11-16 18:22:50,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 18:22:50,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 108 [2024-11-16 18:22:50,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:50,743 INFO L225 Difference]: With dead ends: 1068 [2024-11-16 18:22:50,743 INFO L226 Difference]: Without dead ends: 563 [2024-11-16 18:22:50,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 18:22:50,744 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:50,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 280 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:50,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-16 18:22:50,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2024-11-16 18:22:50,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 515 states have (on average 1.30873786407767) internal successors, (674), 515 states have internal predecessors, (674), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:22:50,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 746 transitions. [2024-11-16 18:22:50,813 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 746 transitions. Word has length 108 [2024-11-16 18:22:50,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:50,813 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 746 transitions. [2024-11-16 18:22:50,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 746 transitions. [2024-11-16 18:22:50,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:22:50,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:50,814 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:50,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-16 18:22:50,814 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:50,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:50,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1619442297, now seen corresponding path program 1 times [2024-11-16 18:22:50,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:50,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112525855] [2024-11-16 18:22:50,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:50,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:22:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 18:22:51,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-16 18:22:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 18:22:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:22:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-16 18:22:51,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 18:22:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 18:22:51,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 18:22:51,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:22:51,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:22:51,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112525855] [2024-11-16 18:22:51,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112525855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:51,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:51,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:22:51,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707567397] [2024-11-16 18:22:51,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:51,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 18:22:51,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:22:51,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 18:22:51,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-16 18:22:51,233 INFO L87 Difference]: Start difference. First operand 563 states and 746 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:51,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:51,582 INFO L93 Difference]: Finished difference Result 573 states and 755 transitions. [2024-11-16 18:22:51,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 18:22:51,582 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 108 [2024-11-16 18:22:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:51,584 INFO L225 Difference]: With dead ends: 573 [2024-11-16 18:22:51,584 INFO L226 Difference]: Without dead ends: 570 [2024-11-16 18:22:51,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-16 18:22:51,585 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 335 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:51,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1122 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 18:22:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-16 18:22:51,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 566. [2024-11-16 18:22:51,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 518 states have (on average 1.306949806949807) internal successors, (677), 518 states have internal predecessors, (677), 36 states have call successors, (36), 11 states have call predecessors, (36), 11 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-16 18:22:51,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 749 transitions. [2024-11-16 18:22:51,655 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 749 transitions. Word has length 108 [2024-11-16 18:22:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:51,655 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 749 transitions. [2024-11-16 18:22:51,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:22:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 749 transitions. [2024-11-16 18:22:51,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 18:22:51,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:51,656 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:51,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-16 18:22:51,656 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:51,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:51,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1648071448, now seen corresponding path program 1 times [2024-11-16 18:22:51,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:22:51,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677835314] [2024-11-16 18:22:51,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:51,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:22:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:22:51,696 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:22:51,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:22:51,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:22:51,778 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:22:51,779 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:22:51,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-16 18:22:51,782 INFO L407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:51,908 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:22:51,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:22:51 BoogieIcfgContainer [2024-11-16 18:22:51,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:22:51,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:22:51,913 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:22:51,913 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:22:51,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:22:16" (3/4) ... [2024-11-16 18:22:51,915 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:22:51,916 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:22:51,919 INFO L158 Benchmark]: Toolchain (without parser) took 36967.24ms. Allocated memory was 159.4MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 87.7MB in the beginning and 1.1GB in the end (delta: -965.8MB). Peak memory consumption was 256.3MB. Max. memory is 16.1GB. [2024-11-16 18:22:51,919 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:22:51,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.10ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 71.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 18:22:51,920 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.73ms. Allocated memory is still 159.4MB. Free memory was 71.1MB in the beginning and 66.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 18:22:51,920 INFO L158 Benchmark]: Boogie Preprocessor took 111.01ms. Allocated memory was 159.4MB in the beginning and 257.9MB in the end (delta: 98.6MB). Free memory was 66.7MB in the beginning and 227.0MB in the end (delta: -160.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2024-11-16 18:22:51,920 INFO L158 Benchmark]: IcfgBuilder took 639.99ms. Allocated memory is still 257.9MB. Free memory was 227.0MB in the beginning and 181.9MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-16 18:22:51,920 INFO L158 Benchmark]: TraceAbstraction took 35866.72ms. Allocated memory was 257.9MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 180.8MB in the beginning and 1.1GB in the end (delta: -872.6MB). Peak memory consumption was 249.4MB. Max. memory is 16.1GB. [2024-11-16 18:22:51,920 INFO L158 Benchmark]: Witness Printer took 3.17ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:22:51,922 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.15ms. Allocated memory is still 159.4MB. Free memory is still 109.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.10ms. Allocated memory is still 159.4MB. Free memory was 87.5MB in the beginning and 71.1MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.73ms. Allocated memory is still 159.4MB. Free memory was 71.1MB in the beginning and 66.7MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.01ms. Allocated memory was 159.4MB in the beginning and 257.9MB in the end (delta: 98.6MB). Free memory was 66.7MB in the beginning and 227.0MB in the end (delta: -160.3MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * IcfgBuilder took 639.99ms. Allocated memory is still 257.9MB. Free memory was 227.0MB in the beginning and 181.9MB in the end (delta: 45.1MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 35866.72ms. Allocated memory was 257.9MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 180.8MB in the beginning and 1.1GB in the end (delta: -872.6MB). Peak memory consumption was 249.4MB. Max. memory is 16.1GB. * Witness Printer took 3.17ms. Allocated memory is still 1.4GB. Free memory is still 1.1GB. There was no memory consumed. Max. memory is 16.1GB. * 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 99, overapproximation of someUnaryDOUBLEoperation at line 27. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[1] = { 0 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L26-L28] float float_Array_0[5] = { 49.5, 256.5, -0.25, 0.30000000000000004, 0.4 }; [L29] float* float_Array_0_arrayfloat_Array_0arrayVar0_Pointer = &(float_Array_0[0]); [L30] float* float_Array_0_arrayfloat_Array_0arrayVar1_Pointer = &(float_Array_0[1]); [L31] float* float_Array_0_arrayfloat_Array_0arrayVar2_Pointer = &(float_Array_0[2]); [L32] float* float_Array_0_arrayfloat_Array_0arrayVar3_Pointer = &(float_Array_0[3]); [L33] float* float_Array_0_arrayfloat_Array_0arrayVar4_Pointer = &(float_Array_0[4]); [L34-L36] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L34-L36] signed long int signed_long_int_Array_0[2] = { -8, -256 }; [L37] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer = &(signed_long_int_Array_0[0]); [L38] signed long int* signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer = &(signed_long_int_Array_0[1]); [L39-L41] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L39-L41] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L39-L41] signed short int signed_short_int_Array_0[2] = { 4, -10 }; [L42] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer = &(signed_short_int_Array_0[0]); [L43] signed short int* signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer = &(signed_short_int_Array_0[1]); [L44-L46] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L44-L46] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L44-L46] unsigned char unsigned_char_Array_0[2] = { 32, 200 }; [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0]); [L48] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1]); [L49] signed long int last_1_signed_long_int_Array_0_0_ = -8; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=0, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L96] EXPR signed_long_int_Array_0[0] [L96] last_1_signed_long_int_Array_0_0_ = signed_long_int_Array_0[0] [L106] RET updateLastVariables() [L107] CALL updateVariables() [L79] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L80] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L80] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L80] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L81] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L81] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L81] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L82] float_Array_0[0] = __VERIFIER_nondet_float() [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F [L83] EXPR float_Array_0[0] [L83] EXPR float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] EXPR (float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] CALL assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L83] RET assume_abort_if_not((float_Array_0[0] >= 0.0F && float_Array_0[0] <= -1.0e-20F) || (float_Array_0[0] <= 4611686.018427382800e+12F && float_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L84] float_Array_0[2] = __VERIFIER_nondet_float() [L85] EXPR float_Array_0[2] [L85] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F [L85] EXPR float_Array_0[2] [L85] EXPR float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] EXPR (float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] CALL assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L85] RET assume_abort_if_not((float_Array_0[2] >= -461168.6018427382800e+13F && float_Array_0[2] <= -1.0e-20F) || (float_Array_0[2] <= 4611686.018427382800e+12F && float_Array_0[2] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L86] float_Array_0[3] = __VERIFIER_nondet_float() [L87] EXPR float_Array_0[3] [L87] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F [L87] EXPR float_Array_0[3] [L87] EXPR float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] EXPR (float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] CALL assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L87] RET assume_abort_if_not((float_Array_0[3] >= 0.0F && float_Array_0[3] <= -1.0e-20F) || (float_Array_0[3] <= 4611686.018427382800e+12F && float_Array_0[3] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L88] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L89] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L89] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L89] RET assume_abort_if_not(signed_short_int_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L90] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L90] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L90] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 16383) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L91] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L93] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, \old(cond)=1, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L107] RET updateVariables() [L108] CALL step() [L53] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L53] COND FALSE !((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) [L56] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L56] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L57] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)); [L58] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L58] COND TRUE ! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) [L59] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L59] (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) [L67] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L67] (*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) = (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) [L68] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L68] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L68] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_1=200, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L68] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) [L68] signed long int stepLocal_0 = ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)); [L69] COND FALSE !(stepLocal_0 < -1) [L72] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L72] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L72] (*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) = (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) [L74] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L74] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L74] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L74] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L74] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_1=200, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L74] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, stepLocal_1=200, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L74] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) [L99] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR ((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1) [L99] EXPR \read(*signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1 [L99] EXPR ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer) [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1 [L99] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)))))) [L99] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) [L99] EXPR \read(*signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer) [L99] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L99] EXPR (! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR ((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))) [L99] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar4_Pointer) [L99] EXPR \read(*float_Array_0_arrayfloat_Array_0arrayVar3_Pointer) [L99] EXPR ((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99] EXPR (((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L99-L100] return (((((((((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) ^ (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) + (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))) < -1) ? ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) 8)) : ((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer)) == ((signed short int) (128 - ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) && (((*(signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer)) < last_1_signed_long_int_Array_0_0_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) == ((unsigned char) ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1))) : 1)) && (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) < ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) & ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) | (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))) ? ((*(float_Array_0_arrayfloat_Array_0arrayVar1_Pointer)) == ((float) (((((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) < 0 ) ? -((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))) : ((*(float_Array_0_arrayfloat_Array_0arrayVar2_Pointer)) + ((*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer)) - (*(float_Array_0_arrayfloat_Array_0arrayVar0_Pointer)))))))) : 1)) && ((! (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) : ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer)) == ((signed long int) (*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer))))))) && ((*(float_Array_0_arrayfloat_Array_0arrayVar4_Pointer)) == ((float) (*(float_Array_0_arrayfloat_Array_0arrayVar3_Pointer))))) && ((*(signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer)) == ((signed long int) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, float_Array_0={5:0}, float_Array_0_arrayfloat_Array_0arrayVar0_Pointer={5:0}, float_Array_0_arrayfloat_Array_0arrayVar1_Pointer={5:4}, float_Array_0_arrayfloat_Array_0arrayVar2_Pointer={5:8}, float_Array_0_arrayfloat_Array_0arrayVar3_Pointer={5:12}, float_Array_0_arrayfloat_Array_0arrayVar4_Pointer={5:16}, isInitial=1, last_1_signed_long_int_Array_0_0_=-8, signed_long_int_Array_0={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var0_Pointer={6:0}, signed_long_int_Array_0_arraysigned_long_int_Array_0Var1_Pointer={6:4}, signed_short_int_Array_0={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var0_Pointer={7:0}, signed_short_int_Array_0_arraysigned_short_int_Array_0Var1_Pointer={7:2}, unsigned_char_Array_0={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={8:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={8:1}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 110 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 40, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 19.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13903 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13901 mSDsluCounter, 46455 SdHoareTripleChecker+Invalid, 9.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38352 mSDsCounter, 1238 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16597 IncrementalHoareTripleChecker+Invalid, 17835 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1238 mSolverCounterUnsat, 8103 mSDtfsCounter, 16597 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1542 GetRequests, 1028 SyntacticMatches, 0 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1752 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1638occurred in iteration=33, InterpolantAutomatonStates: 416, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 11808 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.8s InterpolantComputationTime, 4248 NumberOfCodeBlocks, 4248 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 4205 ConstructedInterpolants, 0 QuantifiedInterpolants, 20698 SizeOfPredicates, 11 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 41 InterpolantComputations, 38 PerfectInterpolantSequences, 5797/5904 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 [2024-11-16 18:22:51,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:22:54,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:22:54,100 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:22:54,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:22:54,103 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:22:54,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:22:54,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:22:54,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:22:54,126 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:22:54,129 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:22:54,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:22:54,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:22:54,130 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:22:54,130 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:22:54,130 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:22:54,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:22:54,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:22:54,130 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:22:54,131 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:22:54,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:22:54,131 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:22:54,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:22:54,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:22:54,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:22:54,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:22:54,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:22:54,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:22:54,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:22:54,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:22:54,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:22:54,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:22:54,136 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:22:54,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:22:54,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:22:54,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:22:54,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:22:54,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:22:54,138 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c10bc5269f02c9aa2d06430e1ef937fd31a71806b45a94b23810b1c4353f541d [2024-11-16 18:22:54,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:22:54,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:22:54,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:22:54,430 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:22:54,430 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:22:54,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2024-11-16 18:22:55,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:22:55,978 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:22:55,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i [2024-11-16 18:22:55,992 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7266250c7/70bf690547384738a3e7238f5d32f9da/FLAG814f0ce1e [2024-11-16 18:22:56,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7266250c7/70bf690547384738a3e7238f5d32f9da [2024-11-16 18:22:56,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:22:56,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:22:56,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:22:56,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:22:56,023 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:22:56,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fd4163e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56, skipping insertion in model container [2024-11-16 18:22:56,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:22:56,219 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i[917,930] [2024-11-16 18:22:56,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:22:56,313 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:22:56,322 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-33.i[917,930] [2024-11-16 18:22:56,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:22:56,356 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:22:56,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56 WrapperNode [2024-11-16 18:22:56,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:22:56,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:22:56,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:22:56,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:22:56,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,414 INFO L138 Inliner]: procedures = 36, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 425 [2024-11-16 18:22:56,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:22:56,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:22:56,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:22:56,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:22:56,425 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,460 INFO L175 MemorySlicer]: Split 115 memory accesses to 6 slices as follows [2, 6, 44, 21, 11, 31]. 38 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 1, 5, 2, 2, 2]. The 15 writes are split as follows [0, 1, 5, 4, 3, 2]. [2024-11-16 18:22:56,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,493 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,508 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:22:56,509 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:22:56,509 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:22:56,509 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:22:56,510 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (1/1) ... [2024-11-16 18:22:56,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:22:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:22:56,545 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) [2024-11-16 18:22:56,557 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 [2024-11-16 18:22:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:22:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 18:22:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 18:22:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-16 18:22:56,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-16 18:22:56,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-16 18:22:56,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-16 18:22:56,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2024-11-16 18:22:56,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-16 18:22:56,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-16 18:22:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-16 18:22:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-16 18:22:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-16 18:22:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:22:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:22:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:22:56,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:22:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-16 18:22:56,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-16 18:22:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-16 18:22:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-16 18:22:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-16 18:22:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-16 18:22:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-16 18:22:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-16 18:22:56,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-16 18:22:56,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-16 18:22:56,761 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:22:56,763 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:22:59,342 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~mem68#1;havoc property_#t~mem69#1;havoc property_#t~mem70#1;havoc property_#t~ite75#1;havoc property_#t~mem71#1;havoc property_#t~mem74#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~mem76#1;havoc property_#t~ite79#1;havoc property_#t~mem78#1;havoc property_#t~mem77#1;havoc property_#t~short80#1;havoc property_#t~mem84#1;havoc property_#t~mem83#1;havoc property_#t~mem81#1;havoc property_#t~mem82#1;havoc property_#t~ite96#1;havoc property_#t~mem95#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~ite94#1;havoc property_#t~mem90#1;havoc property_#t~mem88#1;havoc property_#t~mem89#1;havoc property_#t~mem93#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~short97#1;havoc property_#t~mem98#1;havoc property_#t~ite109#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~ite108#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~short110#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~short113#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~short116#1; [2024-11-16 18:22:59,386 INFO L? ?]: Removed 111 outVars from TransFormulas that were not future-live. [2024-11-16 18:22:59,386 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:22:59,402 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:22:59,403 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:22:59,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:22:59 BoogieIcfgContainer [2024-11-16 18:22:59,404 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:22:59,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:22:59,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:22:59,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:22:59,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:22:56" (1/3) ... [2024-11-16 18:22:59,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8218d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:22:59, skipping insertion in model container [2024-11-16 18:22:59,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:22:56" (2/3) ... [2024-11-16 18:22:59,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8218d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:22:59, skipping insertion in model container [2024-11-16 18:22:59,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:22:59" (3/3) ... [2024-11-16 18:22:59,412 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-33.i [2024-11-16 18:22:59,427 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:22:59,428 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:22:59,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:22:59,489 INFO L333 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, 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;@73e2216d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:22:59,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:22:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:22:59,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:22:59,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:59,504 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:59,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:22:59,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:22:59,509 INFO L85 PathProgramCache]: Analyzing trace with hash 687691551, now seen corresponding path program 1 times [2024-11-16 18:22:59,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:22:59,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751450068] [2024-11-16 18:22:59,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:22:59,521 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:22:59,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:22:59,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:22:59,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 18:22:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:22:59,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:22:59,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:22:59,851 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-11-16 18:22:59,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:22:59,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:22:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751450068] [2024-11-16 18:22:59,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751450068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:22:59,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:22:59,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:22:59,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614610696] [2024-11-16 18:22:59,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:22:59,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:22:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:22:59,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:22:59,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:22:59,880 INFO L87 Difference]: Start difference. First operand has 88 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 77 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:22:59,900 INFO L93 Difference]: Finished difference Result 168 states and 252 transitions. [2024-11-16 18:22:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:22:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-16 18:22:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:22:59,907 INFO L225 Difference]: With dead ends: 168 [2024-11-16 18:22:59,908 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 18:22:59,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:22:59,913 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:22:59,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:22:59,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 18:22:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-16 18:22:59,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 72 states have (on average 1.375) internal successors, (99), 72 states have internal predecessors, (99), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:22:59,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2024-11-16 18:22:59,969 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 94 [2024-11-16 18:22:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:22:59,969 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2024-11-16 18:22:59,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 1 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:22:59,970 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2024-11-16 18:22:59,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:22:59,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:22:59,972 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:22:59,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:23:00,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:00,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:23:00,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:23:00,178 INFO L85 PathProgramCache]: Analyzing trace with hash -478557822, now seen corresponding path program 1 times [2024-11-16 18:23:00,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:23:00,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089021635] [2024-11-16 18:23:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:00,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:00,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:23:00,182 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:23:00,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 18:23:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:00,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 18:23:00,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-16 18:23:00,502 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:23:00,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:23:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089021635] [2024-11-16 18:23:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2089021635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:23:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:23:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 18:23:00,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847736769] [2024-11-16 18:23:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:23:00,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 18:23:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:23:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 18:23:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:23:00,505 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:23:00,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:23:00,577 INFO L93 Difference]: Finished difference Result 165 states and 234 transitions. [2024-11-16 18:23:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 18:23:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2024-11-16 18:23:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:23:00,580 INFO L225 Difference]: With dead ends: 165 [2024-11-16 18:23:00,580 INFO L226 Difference]: Without dead ends: 85 [2024-11-16 18:23:00,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 18:23:00,581 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:23:00,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 334 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:23:00,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-16 18:23:00,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-16 18:23:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 74 states have (on average 1.364864864864865) internal successors, (101), 74 states have internal predecessors, (101), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:23:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 119 transitions. [2024-11-16 18:23:00,593 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 119 transitions. Word has length 94 [2024-11-16 18:23:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:23:00,597 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 119 transitions. [2024-11-16 18:23:00,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:23:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 119 transitions. [2024-11-16 18:23:00,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:23:00,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:23:00,599 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:23:00,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 18:23:00,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:00,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:23:00,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:23:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 129519041, now seen corresponding path program 1 times [2024-11-16 18:23:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:23:00,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247209543] [2024-11-16 18:23:00,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:23:00,805 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:23:00,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 18:23:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:01,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:23:01,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:01,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:23:02,631 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:23:02,632 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:23:02,904 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:23:02,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-16 18:23:03,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:23:03,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247209543] [2024-11-16 18:23:03,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247209543] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:23:03,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [935452214] [2024-11-16 18:23:03,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:03,024 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:23:03,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:23:03,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:23:03,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-16 18:23:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:03,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 18:23:03,321 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:03,398 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:23:03,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:23:03,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [935452214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:23:03,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:23:03,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 14 [2024-11-16 18:23:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662118822] [2024-11-16 18:23:03,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:23:03,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:23:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:23:03,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:23:03,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:23:03,400 INFO L87 Difference]: Start difference. First operand 85 states and 119 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:23:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:23:03,464 INFO L93 Difference]: Finished difference Result 174 states and 245 transitions. [2024-11-16 18:23:03,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 18:23:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-16 18:23:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:23:03,466 INFO L225 Difference]: With dead ends: 174 [2024-11-16 18:23:03,468 INFO L226 Difference]: Without dead ends: 92 [2024-11-16 18:23:03,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:23:03,469 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:23:03,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 529 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:23:03,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-16 18:23:03,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-16 18:23:03,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 80 states have (on average 1.3375) internal successors, (107), 80 states have internal predecessors, (107), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:23:03,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2024-11-16 18:23:03,482 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 94 [2024-11-16 18:23:03,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:23:03,482 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2024-11-16 18:23:03,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:23:03,483 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2024-11-16 18:23:03,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:23:03,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:23:03,485 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:23:03,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-16 18:23:03,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-16 18:23:03,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-16 18:23:03,886 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:23:03,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:23:03,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1872329376, now seen corresponding path program 1 times [2024-11-16 18:23:03,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:23:03,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653322484] [2024-11-16 18:23:03,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:03,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:03,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:23:03,890 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:23:03,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 18:23:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:04,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:23:04,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:04,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:23:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:23:07,800 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:23:08,005 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:23:08,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-16 18:23:08,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:23:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653322484] [2024-11-16 18:23:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653322484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:23:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [280289209] [2024-11-16 18:23:08,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:08,147 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:23:08,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:23:08,150 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:23:08,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-16 18:23:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:08,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:23:08,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:23:08,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:23:08,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [280289209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:23:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:23:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2024-11-16 18:23:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259981073] [2024-11-16 18:23:08,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:23:08,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 18:23:08,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:23:08,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 18:23:08,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=359, Unknown=2, NotChecked=0, Total=420 [2024-11-16 18:23:08,589 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:23:08,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:23:08,664 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2024-11-16 18:23:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:23:08,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-16 18:23:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:23:08,665 INFO L225 Difference]: With dead ends: 182 [2024-11-16 18:23:08,665 INFO L226 Difference]: Without dead ends: 94 [2024-11-16 18:23:08,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=59, Invalid=359, Unknown=2, NotChecked=0, Total=420 [2024-11-16 18:23:08,666 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:23:08,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 628 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 18:23:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-16 18:23:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-11-16 18:23:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-16 18:23:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2024-11-16 18:23:08,671 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 94 [2024-11-16 18:23:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:23:08,671 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2024-11-16 18:23:08,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:23:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2024-11-16 18:23:08,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:23:08,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:23:08,672 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:23:08,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-16 18:23:08,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-16 18:23:09,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:09,077 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:23:09,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:23:09,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1900958527, now seen corresponding path program 1 times [2024-11-16 18:23:09,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:23:09,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517414344] [2024-11-16 18:23:09,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:09,078 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:09,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:23:09,080 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:23:09,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-16 18:23:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:09,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:23:09,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:09,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:23:09,976 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:23:09,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:23:10,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:23:10,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-16 18:23:10,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:23:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [517414344] [2024-11-16 18:23:10,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [517414344] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:23:10,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2066659536] [2024-11-16 18:23:10,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:10,215 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:23:10,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:23:10,217 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:23:10,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2024-11-16 18:23:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:10,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 18:23:10,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:10,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-16 18:23:10,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-16 18:23:10,760 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-16 18:23:10,760 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:23:10,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2066659536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:23:10,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 18:23:10,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2024-11-16 18:23:10,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456915285] [2024-11-16 18:23:10,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:23:10,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 18:23:10,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:23:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 18:23:10,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2024-11-16 18:23:10,762 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:23:10,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:23:10,841 INFO L93 Difference]: Finished difference Result 260 states and 355 transitions. [2024-11-16 18:23:10,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 18:23:10,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 94 [2024-11-16 18:23:10,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:23:10,843 INFO L225 Difference]: With dead ends: 260 [2024-11-16 18:23:10,843 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 18:23:10,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2024-11-16 18:23:10,844 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 89 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 18:23:10,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 570 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:23:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 18:23:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2024-11-16 18:23:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 149 states have (on average 1.3355704697986577) internal successors, (199), 150 states have internal predecessors, (199), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-16 18:23:10,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 227 transitions. [2024-11-16 18:23:10,861 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 227 transitions. Word has length 94 [2024-11-16 18:23:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:23:10,862 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 227 transitions. [2024-11-16 18:23:10,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-16 18:23:10,862 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 227 transitions. [2024-11-16 18:23:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:23:10,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:23:10,863 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:23:10,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2024-11-16 18:23:11,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-16 18:23:11,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:11,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:23:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:23:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1390424350, now seen corresponding path program 1 times [2024-11-16 18:23:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:23:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118946632] [2024-11-16 18:23:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:11,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:11,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:23:11,279 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:23:11,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-16 18:23:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:11,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-16 18:23:11,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:12,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:23:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:23:13,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:23:14,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 18:23:14,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-16 18:23:14,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:23:14,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118946632] [2024-11-16 18:23:14,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118946632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:23:14,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [467308077] [2024-11-16 18:23:14,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:14,101 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 18:23:14,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 18:23:14,103 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 18:23:14,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2024-11-16 18:23:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:14,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:23:14,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:15,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-16 18:23:16,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2024-11-16 18:23:16,967 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 3 proven. 89 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-16 18:23:16,968 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 18:23:17,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-16 18:23:17,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [467308077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 18:23:17,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 18:23:17,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-16 18:23:17,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919644323] [2024-11-16 18:23:17,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 18:23:17,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 18:23:17,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:23:17,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 18:23:17,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=416, Unknown=1, NotChecked=0, Total=506 [2024-11-16 18:23:17,132 INFO L87 Difference]: Start difference. First operand 166 states and 227 transitions. Second operand has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:23:19,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:23:24,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:23:28,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-16 18:23:29,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:23:29,062 INFO L93 Difference]: Finished difference Result 472 states and 640 transitions. [2024-11-16 18:23:29,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:23:29,062 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) Word has length 94 [2024-11-16 18:23:29,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:23:29,065 INFO L225 Difference]: With dead ends: 472 [2024-11-16 18:23:29,065 INFO L226 Difference]: Without dead ends: 309 [2024-11-16 18:23:29,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 265 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=277, Invalid=844, Unknown=1, NotChecked=0, Total=1122 [2024-11-16 18:23:29,068 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 432 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 71 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-16 18:23:29,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 952 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 254 Invalid, 3 Unknown, 0 Unchecked, 9.4s Time] [2024-11-16 18:23:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-16 18:23:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 214. [2024-11-16 18:23:29,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 186 states have (on average 1.3172043010752688) internal successors, (245), 187 states have internal predecessors, (245), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:23:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 291 transitions. [2024-11-16 18:23:29,091 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 291 transitions. Word has length 94 [2024-11-16 18:23:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:23:29,091 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 291 transitions. [2024-11-16 18:23:29,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.133333333333334) internal successors, (92), 14 states have internal predecessors, (92), 6 states have call successors, (18), 6 states have call predecessors, (18), 6 states have return successors, (18), 4 states have call predecessors, (18), 6 states have call successors, (18) [2024-11-16 18:23:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 291 transitions. [2024-11-16 18:23:29,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-16 18:23:29,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:23:29,096 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:23:29,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2024-11-16 18:23:29,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-16 18:23:29,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:29,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:23:29,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:23:29,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1323417597, now seen corresponding path program 1 times [2024-11-16 18:23:29,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:23:29,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803819111] [2024-11-16 18:23:29,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:29,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:29,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:23:29,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:23:29,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-16 18:23:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:29,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:23:29,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:29,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2024-11-16 18:23:29,779 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-16 18:23:29,780 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:23:29,780 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:23:29,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803819111] [2024-11-16 18:23:29,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803819111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:23:29,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:23:29,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:23:29,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019237143] [2024-11-16 18:23:29,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:23:29,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:23:29,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:23:29,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:23:29,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:23:29,782 INFO L87 Difference]: Start difference. First operand 214 states and 291 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:23:33,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:23:33,318 INFO L93 Difference]: Finished difference Result 416 states and 565 transitions. [2024-11-16 18:23:33,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 18:23:33,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2024-11-16 18:23:33,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:23:33,320 INFO L225 Difference]: With dead ends: 416 [2024-11-16 18:23:33,320 INFO L226 Difference]: Without dead ends: 217 [2024-11-16 18:23:33,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-16 18:23:33,321 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 102 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-16 18:23:33,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 366 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-16 18:23:33,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-16 18:23:33,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2024-11-16 18:23:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 186 states have (on average 1.3010752688172043) internal successors, (242), 187 states have internal predecessors, (242), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-16 18:23:33,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 288 transitions. [2024-11-16 18:23:33,340 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 288 transitions. Word has length 94 [2024-11-16 18:23:33,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:23:33,340 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 288 transitions. [2024-11-16 18:23:33,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-16 18:23:33,341 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 288 transitions. [2024-11-16 18:23:33,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-16 18:23:33,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:23:33,346 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 18:23:33,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-16 18:23:33,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:33,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:23:33,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:23:33,547 INFO L85 PathProgramCache]: Analyzing trace with hash -2102406657, now seen corresponding path program 1 times [2024-11-16 18:23:33,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:23:33,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033865684] [2024-11-16 18:23:33,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:23:33,548 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 18:23:33,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:23:33,549 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 18:23:33,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-16 18:23:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:23:33,766 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 18:23:33,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:23:33,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-16 18:23:33,877 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-16 18:23:33,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:23:33,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:23:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033865684] [2024-11-16 18:23:33,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033865684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:23:33,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:23:33,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 18:23:33,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935694345] [2024-11-16 18:23:33,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:23:33,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 18:23:33,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:23:33,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 18:23:33,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-16 18:23:33,879 INFO L87 Difference]: Start difference. First operand 214 states and 288 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9)