./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:35:55,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:35:55,625 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:35:55,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:35:55,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:35:55,642 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:35:55,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:35:55,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:35:55,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:35:55,643 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:35:55,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:35:55,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:35:55,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:35:55,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:35:55,643 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:35:55,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:35:55,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:35:55,644 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:35:55,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:35:55,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:35:55,645 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:35:55,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:35:55,646 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2025-01-09 15:35:55,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:35:55,880 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:35:55,883 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:35:55,884 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:35:55,884 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:35:55,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2025-01-09 15:35:57,059 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/234004ce5/f86924a51aea427f861b4b943e6193e6/FLAGbc82e258f [2025-01-09 15:35:57,361 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:35:57,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2025-01-09 15:35:57,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/234004ce5/f86924a51aea427f861b4b943e6193e6/FLAGbc82e258f [2025-01-09 15:35:57,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/234004ce5/f86924a51aea427f861b4b943e6193e6 [2025-01-09 15:35:57,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:35:57,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:35:57,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:35:57,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:35:57,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:35:57,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b7fc280 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57, skipping insertion in model container [2025-01-09 15:35:57,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,670 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:35:57,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2025-01-09 15:35:57,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:35:57,835 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:35:57,844 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2025-01-09 15:35:57,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:35:57,897 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:35:57,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57 WrapperNode [2025-01-09 15:35:57,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:35:57,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:35:57,899 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:35:57,899 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:35:57,903 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,957 INFO L138 Inliner]: procedures = 29, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2025-01-09 15:35:57,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:35:57,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:35:57,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:35:57,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:35:57,964 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,997 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2025-01-09 15:35:57,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:57,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:58,011 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:58,012 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:58,019 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:58,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:58,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:58,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:35:58,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:35:58,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:35:58,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:35:58,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (1/1) ... [2025-01-09 15:35:58,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:35:58,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:35:58,054 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:35:58,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:35:58,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:35:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:35:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:35:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:35:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:35:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:35:58,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:35:58,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:35:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:35:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:35:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:35:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:35:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:35:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:35:58,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:35:58,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:35:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:35:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:35:58,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:35:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:35:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:35:58,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:35:58,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:35:58,194 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:35:58,195 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:35:58,616 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-01-09 15:35:58,617 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:35:58,623 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:35:58,624 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:35:58,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:35:58 BoogieIcfgContainer [2025-01-09 15:35:58,624 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:35:58,625 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:35:58,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:35:58,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:35:58,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:35:57" (1/3) ... [2025-01-09 15:35:58,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f77d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:35:58, skipping insertion in model container [2025-01-09 15:35:58,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:35:57" (2/3) ... [2025-01-09 15:35:58,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f77d3dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:35:58, skipping insertion in model container [2025-01-09 15:35:58,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:35:58" (3/3) ... [2025-01-09 15:35:58,630 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2025-01-09 15:35:58,639 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:35:58,640 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:35:58,688 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:35:58,696 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;@50c155ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:35:58,697 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:35:58,699 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:35:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:35:58,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:35:58,706 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:35:58,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:35:58,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:35:58,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1231487151, now seen corresponding path program 1 times [2025-01-09 15:35:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:35:58,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355560553] [2025-01-09 15:35:58,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:35:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:35:58,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:35:58,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:35:58,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:35:58,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:35:58,968 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:35:58,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:35:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355560553] [2025-01-09 15:35:58,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355560553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:35:58,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354985238] [2025-01-09 15:35:58,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:35:58,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:35:58,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:35:58,972 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:35:58,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:35:59,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:35:59,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:35:59,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:35:59,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:35:59,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:35:59,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:35:59,206 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:35:59,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:35:59,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354985238] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:35:59,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:35:59,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:35:59,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975857408] [2025-01-09 15:35:59,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:35:59,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:35:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:35:59,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:35:59,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:35:59,223 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:35:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:35:59,240 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-01-09 15:35:59,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:35:59,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-01-09 15:35:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:35:59,245 INFO L225 Difference]: With dead ends: 244 [2025-01-09 15:35:59,245 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:35:59,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:35:59,248 INFO L435 NwaCegarLoop]: 180 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, 180 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 [2025-01-09 15:35:59,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:35:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:35:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:35:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:35:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-01-09 15:35:59,280 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-01-09 15:35:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:35:59,280 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-01-09 15:35:59,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:35:59,280 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-01-09 15:35:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:35:59,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:35:59,282 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:35:59,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:35:59,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:35:59,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:35:59,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:35:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1456886325, now seen corresponding path program 1 times [2025-01-09 15:35:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:35:59,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6873866] [2025-01-09 15:35:59,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:35:59,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:35:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:35:59,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:35:59,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:35:59,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:35:59,729 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:35:59,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:35:59,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6873866] [2025-01-09 15:35:59,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6873866] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:35:59,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:35:59,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:35:59,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475166523] [2025-01-09 15:35:59,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:35:59,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:35:59,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:35:59,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:35:59,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:35:59,731 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:35:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:35:59,762 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2025-01-09 15:35:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:35:59,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:35:59,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:35:59,764 INFO L225 Difference]: With dead ends: 242 [2025-01-09 15:35:59,764 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 15:35:59,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:35:59,765 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:35:59,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:35:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 15:35:59,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 15:35:59,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:35:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-01-09 15:35:59,773 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2025-01-09 15:35:59,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:35:59,774 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-01-09 15:35:59,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:35:59,774 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-01-09 15:35:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:35:59,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:35:59,776 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:35:59,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:35:59,776 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:35:59,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:35:59,777 INFO L85 PathProgramCache]: Analyzing trace with hash 639237875, now seen corresponding path program 1 times [2025-01-09 15:35:59,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:35:59,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695814889] [2025-01-09 15:35:59,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:35:59,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:35:59,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:35:59,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:35:59,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:35:59,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:00,863 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:00,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:00,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695814889] [2025-01-09 15:36:00,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695814889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:36:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665242220] [2025-01-09 15:36:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:00,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:36:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:00,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:36:00,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:36:00,865 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:01,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:01,377 INFO L93 Difference]: Finished difference Result 334 states and 492 transitions. [2025-01-09 15:36:01,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:01,378 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:36:01,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:01,380 INFO L225 Difference]: With dead ends: 334 [2025-01-09 15:36:01,380 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 15:36:01,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:01,381 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 262 mSDsluCounter, 1132 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:01,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 1318 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:01,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 15:36:01,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2025-01-09 15:36:01,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 180 states have (on average 1.4166666666666667) internal successors, (255), 181 states have internal predecessors, (255), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:36:01,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2025-01-09 15:36:01,397 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 151 [2025-01-09 15:36:01,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:01,401 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2025-01-09 15:36:01,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:01,401 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2025-01-09 15:36:01,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:36:01,402 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:01,402 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:01,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:36:01,402 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:01,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:01,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1461419183, now seen corresponding path program 1 times [2025-01-09 15:36:01,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:01,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554409696] [2025-01-09 15:36:01,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:01,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:01,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:36:01,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:36:01,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:01,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:01,486 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:01,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:01,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554409696] [2025-01-09 15:36:01,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554409696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:01,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:01,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:36:01,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176924877] [2025-01-09 15:36:01,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:01,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:36:01,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:01,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:36:01,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:01,488 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:01,512 INFO L93 Difference]: Finished difference Result 421 states and 623 transitions. [2025-01-09 15:36:01,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:36:01,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:36:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:01,514 INFO L225 Difference]: With dead ends: 421 [2025-01-09 15:36:01,514 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 15:36:01,515 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:01,516 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:01,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:01,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 15:36:01,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-01-09 15:36:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 182 states have (on average 1.4120879120879122) internal successors, (257), 183 states have internal predecessors, (257), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:36:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 313 transitions. [2025-01-09 15:36:01,525 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 313 transitions. Word has length 152 [2025-01-09 15:36:01,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:01,526 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 313 transitions. [2025-01-09 15:36:01,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:01,526 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 313 transitions. [2025-01-09 15:36:01,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:36:01,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:01,527 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:01,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:36:01,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:01,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:01,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2134984349, now seen corresponding path program 1 times [2025-01-09 15:36:01,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:01,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812688699] [2025-01-09 15:36:01,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:01,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:36:01,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:36:01,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:01,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:01,597 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:01,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:01,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812688699] [2025-01-09 15:36:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812688699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:01,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:36:01,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275809028] [2025-01-09 15:36:01,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:01,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:36:01,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:01,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:36:01,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:01,599 INFO L87 Difference]: Start difference. First operand 213 states and 313 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:01,622 INFO L93 Difference]: Finished difference Result 424 states and 625 transitions. [2025-01-09 15:36:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:36:01,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:36:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:01,624 INFO L225 Difference]: With dead ends: 424 [2025-01-09 15:36:01,624 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 15:36:01,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:01,626 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:01,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 15:36:01,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2025-01-09 15:36:01,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 184 states have internal predecessors, (258), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:36:01,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 314 transitions. [2025-01-09 15:36:01,642 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 314 transitions. Word has length 152 [2025-01-09 15:36:01,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:01,642 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 314 transitions. [2025-01-09 15:36:01,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:01,642 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 314 transitions. [2025-01-09 15:36:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:01,646 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:01,646 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:01,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:36:01,646 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:01,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:01,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1102248104, now seen corresponding path program 1 times [2025-01-09 15:36:01,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:01,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705277192] [2025-01-09 15:36:01,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:01,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:01,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:01,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:01,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:01,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:36:01,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705277192] [2025-01-09 15:36:01,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705277192] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:36:01,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214973185] [2025-01-09 15:36:01,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:01,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:36:01,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:36:01,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:36:01,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:36:01,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:02,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:02,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:02,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:02,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:36:02,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:36:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:02,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:36:02,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1214973185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:02,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:36:02,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:36:02,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115323306] [2025-01-09 15:36:02,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:02,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:02,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:02,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:02,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:36:02,054 INFO L87 Difference]: Start difference. First operand 214 states and 314 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:02,085 INFO L93 Difference]: Finished difference Result 431 states and 633 transitions. [2025-01-09 15:36:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:02,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:36:02,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:02,089 INFO L225 Difference]: With dead ends: 431 [2025-01-09 15:36:02,089 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 15:36:02,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:36:02,090 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:02,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:02,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 15:36:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-01-09 15:36:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 189 states have (on average 1.3968253968253967) internal successors, (264), 190 states have internal predecessors, (264), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:36:02,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 320 transitions. [2025-01-09 15:36:02,100 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 320 transitions. Word has length 153 [2025-01-09 15:36:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:02,100 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 320 transitions. [2025-01-09 15:36:02,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 320 transitions. [2025-01-09 15:36:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:02,102 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:02,102 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:02,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:36:02,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:36:02,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1965859603, now seen corresponding path program 1 times [2025-01-09 15:36:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062382212] [2025-01-09 15:36:02,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:02,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:02,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:02,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:02,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:03,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:03,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:03,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062382212] [2025-01-09 15:36:03,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062382212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:03,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:03,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:36:03,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878698143] [2025-01-09 15:36:03,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:03,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:36:03,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:03,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:36:03,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:03,494 INFO L87 Difference]: Start difference. First operand 220 states and 320 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:04,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:04,013 INFO L93 Difference]: Finished difference Result 562 states and 816 transitions. [2025-01-09 15:36:04,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:04,014 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:36:04,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:04,015 INFO L225 Difference]: With dead ends: 562 [2025-01-09 15:36:04,015 INFO L226 Difference]: Without dead ends: 345 [2025-01-09 15:36:04,016 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:04,016 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 465 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:04,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 726 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2025-01-09 15:36:04,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 244. [2025-01-09 15:36:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 213 states have (on average 1.4178403755868545) internal successors, (302), 214 states have internal predecessors, (302), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 15:36:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 358 transitions. [2025-01-09 15:36:04,030 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 358 transitions. Word has length 153 [2025-01-09 15:36:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:04,030 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 358 transitions. [2025-01-09 15:36:04,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 358 transitions. [2025-01-09 15:36:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:04,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:04,032 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:04,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:36:04,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:04,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:04,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1049244015, now seen corresponding path program 1 times [2025-01-09 15:36:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:04,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910192880] [2025-01-09 15:36:04,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:04,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:04,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:04,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:04,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:04,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:04,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:04,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910192880] [2025-01-09 15:36:04,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910192880] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:04,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:04,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133393770] [2025-01-09 15:36:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:04,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:04,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:04,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:04,327 INFO L87 Difference]: Start difference. First operand 244 states and 358 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:04,473 INFO L93 Difference]: Finished difference Result 621 states and 904 transitions. [2025-01-09 15:36:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:36:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:04,475 INFO L225 Difference]: With dead ends: 621 [2025-01-09 15:36:04,475 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 15:36:04,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:04,476 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 93 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:04,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 772 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 15:36:04,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-01-09 15:36:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 324 states have (on average 1.3858024691358024) internal successors, (449), 327 states have internal predecessors, (449), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 15:36:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 545 transitions. [2025-01-09 15:36:04,506 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 545 transitions. Word has length 153 [2025-01-09 15:36:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:04,509 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 545 transitions. [2025-01-09 15:36:04,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2025-01-09 15:36:04,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:04,510 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:04,510 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:04,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:36:04,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash 462438001, now seen corresponding path program 1 times [2025-01-09 15:36:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991039406] [2025-01-09 15:36:04,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:04,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:04,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:04,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:04,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:06,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:06,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991039406] [2025-01-09 15:36:06,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991039406] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:06,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:06,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:36:06,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91773582] [2025-01-09 15:36:06,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:06,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:36:06,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:06,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:36:06,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:36:06,198 INFO L87 Difference]: Start difference. First operand 377 states and 545 transitions. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:07,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:07,557 INFO L93 Difference]: Finished difference Result 1322 states and 1912 transitions. [2025-01-09 15:36:07,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:36:07,557 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:36:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:07,563 INFO L225 Difference]: With dead ends: 1322 [2025-01-09 15:36:07,563 INFO L226 Difference]: Without dead ends: 948 [2025-01-09 15:36:07,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=157, Invalid=599, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:36:07,566 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 680 mSDsluCounter, 1347 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:07,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1470 Invalid, 1088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:36:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-01-09 15:36:07,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 461. [2025-01-09 15:36:07,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 386 states have (on average 1.3704663212435233) internal successors, (529), 389 states have internal predecessors, (529), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 663 transitions. [2025-01-09 15:36:07,620 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 663 transitions. Word has length 153 [2025-01-09 15:36:07,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:07,621 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 663 transitions. [2025-01-09 15:36:07,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 16 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:07,621 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 663 transitions. [2025-01-09 15:36:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:07,625 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:07,625 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:07,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:36:07,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:07,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1593385929, now seen corresponding path program 1 times [2025-01-09 15:36:07,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:07,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893816644] [2025-01-09 15:36:07,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:07,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:07,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:07,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:07,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:07,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:07,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893816644] [2025-01-09 15:36:07,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893816644] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:07,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:07,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:07,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259320437] [2025-01-09 15:36:07,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:07,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:07,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:07,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:07,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:07,726 INFO L87 Difference]: Start difference. First operand 461 states and 663 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:07,808 INFO L93 Difference]: Finished difference Result 1054 states and 1525 transitions. [2025-01-09 15:36:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:36:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:07,813 INFO L225 Difference]: With dead ends: 1054 [2025-01-09 15:36:07,814 INFO L226 Difference]: Without dead ends: 677 [2025-01-09 15:36:07,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:07,815 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:07,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 649 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:07,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-01-09 15:36:07,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 518. [2025-01-09 15:36:07,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 443 states have (on average 1.3950338600451466) internal successors, (618), 446 states have internal predecessors, (618), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:07,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 752 transitions. [2025-01-09 15:36:07,851 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 752 transitions. Word has length 153 [2025-01-09 15:36:07,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:07,852 INFO L471 AbstractCegarLoop]: Abstraction has 518 states and 752 transitions. [2025-01-09 15:36:07,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 752 transitions. [2025-01-09 15:36:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:07,853 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:07,853 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:07,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:36:07,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:07,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:07,854 INFO L85 PathProgramCache]: Analyzing trace with hash -511106055, now seen corresponding path program 1 times [2025-01-09 15:36:07,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:07,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96070691] [2025-01-09 15:36:07,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:07,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:07,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:07,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:07,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:07,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:08,877 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:08,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:08,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96070691] [2025-01-09 15:36:08,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96070691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:08,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:08,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:36:08,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104537966] [2025-01-09 15:36:08,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:08,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:36:08,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:08,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:36:08,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:08,879 INFO L87 Difference]: Start difference. First operand 518 states and 752 transitions. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:09,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:09,726 INFO L93 Difference]: Finished difference Result 1129 states and 1644 transitions. [2025-01-09 15:36:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:09,727 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-01-09 15:36:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:09,731 INFO L225 Difference]: With dead ends: 1129 [2025-01-09 15:36:09,731 INFO L226 Difference]: Without dead ends: 696 [2025-01-09 15:36:09,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:36:09,734 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 522 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:09,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 1149 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:36:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-01-09 15:36:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 564. [2025-01-09 15:36:09,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 489 states have (on average 1.4110429447852761) internal successors, (690), 492 states have internal predecessors, (690), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:09,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 824 transitions. [2025-01-09 15:36:09,790 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 824 transitions. Word has length 153 [2025-01-09 15:36:09,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:09,791 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 824 transitions. [2025-01-09 15:36:09,791 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:09,791 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 824 transitions. [2025-01-09 15:36:09,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:09,793 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:09,793 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:09,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:36:09,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:09,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:09,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1097912069, now seen corresponding path program 1 times [2025-01-09 15:36:09,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:09,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252727712] [2025-01-09 15:36:09,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:09,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:09,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:09,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:09,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:09,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:11,422 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:11,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:11,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252727712] [2025-01-09 15:36:11,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252727712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:11,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:11,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:36:11,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039822113] [2025-01-09 15:36:11,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:11,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:36:11,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:11,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:36:11,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:36:11,425 INFO L87 Difference]: Start difference. First operand 564 states and 824 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:12,552 INFO L93 Difference]: Finished difference Result 1175 states and 1715 transitions. [2025-01-09 15:36:12,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:12,553 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:36:12,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:12,556 INFO L225 Difference]: With dead ends: 1175 [2025-01-09 15:36:12,557 INFO L226 Difference]: Without dead ends: 696 [2025-01-09 15:36:12,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=88, Invalid=292, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:36:12,558 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 473 mSDsluCounter, 1052 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:12,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1248 Invalid, 911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:36:12,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2025-01-09 15:36:12,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 564. [2025-01-09 15:36:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 489 states have (on average 1.408997955010225) internal successors, (689), 492 states have internal predecessors, (689), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 823 transitions. [2025-01-09 15:36:12,601 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 823 transitions. Word has length 153 [2025-01-09 15:36:12,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:12,601 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 823 transitions. [2025-01-09 15:36:12,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:12,602 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 823 transitions. [2025-01-09 15:36:12,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:12,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:12,603 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:12,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:36:12,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:12,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:12,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1819634603, now seen corresponding path program 1 times [2025-01-09 15:36:12,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:12,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776408481] [2025-01-09 15:36:12,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:12,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:12,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:12,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:12,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:12,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:13,576 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:13,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:13,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776408481] [2025-01-09 15:36:13,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776408481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:13,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:13,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:36:13,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789577839] [2025-01-09 15:36:13,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:13,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:36:13,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:13,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:36:13,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:13,578 INFO L87 Difference]: Start difference. First operand 564 states and 823 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:14,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:14,431 INFO L93 Difference]: Finished difference Result 1329 states and 1936 transitions. [2025-01-09 15:36:14,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:14,432 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:36:14,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:14,440 INFO L225 Difference]: With dead ends: 1329 [2025-01-09 15:36:14,440 INFO L226 Difference]: Without dead ends: 850 [2025-01-09 15:36:14,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:36:14,442 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 278 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:14,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 1206 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:36:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-01-09 15:36:14,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 592. [2025-01-09 15:36:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 517 states have (on average 1.413926499032882) internal successors, (731), 520 states have internal predecessors, (731), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 865 transitions. [2025-01-09 15:36:14,497 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 865 transitions. Word has length 153 [2025-01-09 15:36:14,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:14,497 INFO L471 AbstractCegarLoop]: Abstraction has 592 states and 865 transitions. [2025-01-09 15:36:14,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 12 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:14,498 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 865 transitions. [2025-01-09 15:36:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:14,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:14,499 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:14,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:36:14,500 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:14,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:14,500 INFO L85 PathProgramCache]: Analyzing trace with hash -47035089, now seen corresponding path program 1 times [2025-01-09 15:36:14,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514990759] [2025-01-09 15:36:14,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:14,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:14,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:14,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:14,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:14,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:16,009 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:16,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514990759] [2025-01-09 15:36:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514990759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:16,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:36:16,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378069658] [2025-01-09 15:36:16,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:16,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:36:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:16,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:36:16,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:36:16,011 INFO L87 Difference]: Start difference. First operand 592 states and 865 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:16,787 INFO L93 Difference]: Finished difference Result 1165 states and 1704 transitions. [2025-01-09 15:36:16,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:16,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:36:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:16,792 INFO L225 Difference]: With dead ends: 1165 [2025-01-09 15:36:16,792 INFO L226 Difference]: Without dead ends: 658 [2025-01-09 15:36:16,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:36:16,794 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 473 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:16,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 1170 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:36:16,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2025-01-09 15:36:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 593. [2025-01-09 15:36:16,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 518 states have (on average 1.4131274131274132) internal successors, (732), 521 states have internal predecessors, (732), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 866 transitions. [2025-01-09 15:36:16,832 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 866 transitions. Word has length 153 [2025-01-09 15:36:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:16,833 INFO L471 AbstractCegarLoop]: Abstraction has 593 states and 866 transitions. [2025-01-09 15:36:16,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 866 transitions. [2025-01-09 15:36:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:16,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:16,835 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:16,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:36:16,835 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:16,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1607385159, now seen corresponding path program 1 times [2025-01-09 15:36:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243028961] [2025-01-09 15:36:16,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:16,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:16,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:16,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:16,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:16,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:17,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:17,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243028961] [2025-01-09 15:36:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243028961] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:36:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650394172] [2025-01-09 15:36:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:17,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:36:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:17,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:36:17,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:17,232 INFO L87 Difference]: Start difference. First operand 593 states and 866 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:17,741 INFO L93 Difference]: Finished difference Result 1577 states and 2307 transitions. [2025-01-09 15:36:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:17,742 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:36:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:17,746 INFO L225 Difference]: With dead ends: 1577 [2025-01-09 15:36:17,746 INFO L226 Difference]: Without dead ends: 1069 [2025-01-09 15:36:17,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:17,748 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 366 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:17,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 909 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1069 states. [2025-01-09 15:36:17,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1069 to 595. [2025-01-09 15:36:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 520 states have (on average 1.4134615384615385) internal successors, (735), 523 states have internal predecessors, (735), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 869 transitions. [2025-01-09 15:36:17,785 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 869 transitions. Word has length 153 [2025-01-09 15:36:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:17,786 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 869 transitions. [2025-01-09 15:36:17,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 869 transitions. [2025-01-09 15:36:17,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:17,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:17,787 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:17,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:36:17,788 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:17,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:17,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1545345545, now seen corresponding path program 1 times [2025-01-09 15:36:17,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:17,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563257953] [2025-01-09 15:36:17,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:17,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:17,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:17,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:17,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:17,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:18,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:18,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563257953] [2025-01-09 15:36:18,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563257953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:18,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:18,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:36:18,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644122060] [2025-01-09 15:36:18,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:18,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:36:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:18,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:36:18,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:36:18,740 INFO L87 Difference]: Start difference. First operand 595 states and 869 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:19,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:19,554 INFO L93 Difference]: Finished difference Result 1169 states and 1709 transitions. [2025-01-09 15:36:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:36:19,554 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:36:19,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:19,557 INFO L225 Difference]: With dead ends: 1169 [2025-01-09 15:36:19,557 INFO L226 Difference]: Without dead ends: 661 [2025-01-09 15:36:19,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:36:19,559 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 458 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:19,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1432 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:36:19,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2025-01-09 15:36:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 591. [2025-01-09 15:36:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 516 states have (on average 1.4127906976744187) internal successors, (729), 519 states have internal predecessors, (729), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 863 transitions. [2025-01-09 15:36:19,596 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 863 transitions. Word has length 153 [2025-01-09 15:36:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:19,596 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 863 transitions. [2025-01-09 15:36:19,597 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 863 transitions. [2025-01-09 15:36:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:36:19,598 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:19,598 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:19,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:36:19,598 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:19,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:19,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1443783325, now seen corresponding path program 1 times [2025-01-09 15:36:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:19,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319393375] [2025-01-09 15:36:19,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:19,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:36:19,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:36:19,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:19,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:19,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:19,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319393375] [2025-01-09 15:36:19,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319393375] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:19,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:19,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:19,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49233393] [2025-01-09 15:36:19,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:19,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:19,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:19,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:19,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:19,672 INFO L87 Difference]: Start difference. First operand 591 states and 863 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:19,755 INFO L93 Difference]: Finished difference Result 1181 states and 1723 transitions. [2025-01-09 15:36:19,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:19,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:36:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:19,757 INFO L225 Difference]: With dead ends: 1181 [2025-01-09 15:36:19,758 INFO L226 Difference]: Without dead ends: 677 [2025-01-09 15:36:19,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:19,759 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 90 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:19,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 807 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-01-09 15:36:19,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 590. [2025-01-09 15:36:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 515 states have (on average 1.4038834951456312) internal successors, (723), 518 states have internal predecessors, (723), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:19,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 857 transitions. [2025-01-09 15:36:19,796 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 857 transitions. Word has length 153 [2025-01-09 15:36:19,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:19,796 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 857 transitions. [2025-01-09 15:36:19,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 857 transitions. [2025-01-09 15:36:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:36:19,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:19,799 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:19,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:36:19,799 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:19,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:19,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1640990665, now seen corresponding path program 1 times [2025-01-09 15:36:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:19,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405303799] [2025-01-09 15:36:19,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:19,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:19,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:36:19,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:36:19,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:19,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:19,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:19,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405303799] [2025-01-09 15:36:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405303799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:19,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:19,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:36:19,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542789524] [2025-01-09 15:36:19,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:19,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:36:19,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:19,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:36:19,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:19,839 INFO L87 Difference]: Start difference. First operand 590 states and 857 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:19,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:19,883 INFO L93 Difference]: Finished difference Result 998 states and 1446 transitions. [2025-01-09 15:36:19,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:36:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:36:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:19,885 INFO L225 Difference]: With dead ends: 998 [2025-01-09 15:36:19,885 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 15:36:19,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:19,886 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:19,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 15:36:19,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-01-09 15:36:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 420 states have (on average 1.3666666666666667) internal successors, (574), 423 states have internal predecessors, (574), 67 states have call successors, (67), 7 states have call predecessors, (67), 7 states have return successors, (67), 64 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 15:36:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 708 transitions. [2025-01-09 15:36:19,922 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 708 transitions. Word has length 154 [2025-01-09 15:36:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:19,923 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 708 transitions. [2025-01-09 15:36:19,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:19,923 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 708 transitions. [2025-01-09 15:36:19,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:36:19,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:19,924 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:19,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:36:19,924 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:19,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:19,924 INFO L85 PathProgramCache]: Analyzing trace with hash -2125062609, now seen corresponding path program 1 times [2025-01-09 15:36:19,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:19,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707236913] [2025-01-09 15:36:19,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:19,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:36:19,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:36:19,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:19,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707236913] [2025-01-09 15:36:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707236913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:36:19,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451971160] [2025-01-09 15:36:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:19,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:36:19,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:19,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:36:19,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:19,964 INFO L87 Difference]: Start difference. First operand 495 states and 708 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:20,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:20,026 INFO L93 Difference]: Finished difference Result 839 states and 1202 transitions. [2025-01-09 15:36:20,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:36:20,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:36:20,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:20,030 INFO L225 Difference]: With dead ends: 839 [2025-01-09 15:36:20,030 INFO L226 Difference]: Without dead ends: 431 [2025-01-09 15:36:20,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:20,031 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:20,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-01-09 15:36:20,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-01-09 15:36:20,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 365 states have (on average 1.3616438356164384) internal successors, (497), 367 states have internal predecessors, (497), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:36:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 613 transitions. [2025-01-09 15:36:20,077 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 613 transitions. Word has length 154 [2025-01-09 15:36:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:20,078 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 613 transitions. [2025-01-09 15:36:20,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:20,079 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 613 transitions. [2025-01-09 15:36:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:20,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:20,080 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:20,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:36:20,080 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:20,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:20,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1059450669, now seen corresponding path program 1 times [2025-01-09 15:36:20,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:20,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811798025] [2025-01-09 15:36:20,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:20,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:20,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:20,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:20,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:20,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:20,973 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:20,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:20,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811798025] [2025-01-09 15:36:20,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811798025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:20,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:20,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:36:20,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039928470] [2025-01-09 15:36:20,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:20,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:36:20,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:20,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:36:20,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:20,975 INFO L87 Difference]: Start difference. First operand 431 states and 613 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:22,100 INFO L93 Difference]: Finished difference Result 1225 states and 1741 transitions. [2025-01-09 15:36:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 15:36:22,100 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:36:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:22,104 INFO L225 Difference]: With dead ends: 1225 [2025-01-09 15:36:22,104 INFO L226 Difference]: Without dead ends: 881 [2025-01-09 15:36:22,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 15:36:22,107 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 662 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:22,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [662 Valid, 1860 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:36:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-01-09 15:36:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 562. [2025-01-09 15:36:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 496 states have (on average 1.3790322580645162) internal successors, (684), 498 states have internal predecessors, (684), 58 states have call successors, (58), 7 states have call predecessors, (58), 7 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:36:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 800 transitions. [2025-01-09 15:36:22,153 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 800 transitions. Word has length 155 [2025-01-09 15:36:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:22,153 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 800 transitions. [2025-01-09 15:36:22,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 800 transitions. [2025-01-09 15:36:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:22,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:22,154 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:22,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:36:22,155 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:22,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash -997411055, now seen corresponding path program 1 times [2025-01-09 15:36:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:22,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654806290] [2025-01-09 15:36:22,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:22,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:22,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:22,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:22,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:22,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:22,340 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:22,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:22,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654806290] [2025-01-09 15:36:22,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654806290] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:22,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:22,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:22,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074618084] [2025-01-09 15:36:22,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:22,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:22,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:22,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:22,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:22,343 INFO L87 Difference]: Start difference. First operand 562 states and 800 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:22,575 INFO L93 Difference]: Finished difference Result 1219 states and 1734 transitions. [2025-01-09 15:36:22,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:22,575 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:36:22,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:22,578 INFO L225 Difference]: With dead ends: 1219 [2025-01-09 15:36:22,578 INFO L226 Difference]: Without dead ends: 866 [2025-01-09 15:36:22,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:22,580 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 112 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:22,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 911 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:36:22,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-01-09 15:36:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 809. [2025-01-09 15:36:22,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 721 states have (on average 1.3841886269070736) internal successors, (998), 725 states have internal predecessors, (998), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:36:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1154 transitions. [2025-01-09 15:36:22,647 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1154 transitions. Word has length 155 [2025-01-09 15:36:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:22,647 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1154 transitions. [2025-01-09 15:36:22,647 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1154 transitions. [2025-01-09 15:36:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:22,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:22,648 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:22,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:36:22,648 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:22,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 655186035, now seen corresponding path program 1 times [2025-01-09 15:36:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:22,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7807565] [2025-01-09 15:36:22,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:22,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:22,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:22,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:22,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:24,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:24,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7807565] [2025-01-09 15:36:24,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7807565] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:24,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:24,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-01-09 15:36:24,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13924540] [2025-01-09 15:36:24,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:24,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 15:36:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:24,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 15:36:24,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:36:24,565 INFO L87 Difference]: Start difference. First operand 809 states and 1154 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:26,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:26,647 INFO L93 Difference]: Finished difference Result 1870 states and 2656 transitions. [2025-01-09 15:36:26,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:36:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:36:26,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:26,651 INFO L225 Difference]: With dead ends: 1870 [2025-01-09 15:36:26,651 INFO L226 Difference]: Without dead ends: 1267 [2025-01-09 15:36:26,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=254, Invalid=1468, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 15:36:26,654 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 685 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 1961 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 2795 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:26,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 2795 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1961 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 15:36:26,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1267 states. [2025-01-09 15:36:26,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1267 to 856. [2025-01-09 15:36:26,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 768 states have (on average 1.390625) internal successors, (1068), 772 states have internal predecessors, (1068), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:36:26,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1224 transitions. [2025-01-09 15:36:26,720 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1224 transitions. Word has length 155 [2025-01-09 15:36:26,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:26,720 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1224 transitions. [2025-01-09 15:36:26,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:26,720 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1224 transitions. [2025-01-09 15:36:26,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:26,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:26,721 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:26,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:36:26,721 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:26,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:26,722 INFO L85 PathProgramCache]: Analyzing trace with hash 68380021, now seen corresponding path program 1 times [2025-01-09 15:36:26,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:26,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461173827] [2025-01-09 15:36:26,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:26,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:26,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:26,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:26,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:26,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:26,855 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:26,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:26,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461173827] [2025-01-09 15:36:26,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461173827] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:26,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:26,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:26,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010475139] [2025-01-09 15:36:26,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:26,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:26,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:26,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:26,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:26,856 INFO L87 Difference]: Start difference. First operand 856 states and 1224 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:27,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:27,020 INFO L93 Difference]: Finished difference Result 1563 states and 2220 transitions. [2025-01-09 15:36:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:27,020 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:36:27,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:27,023 INFO L225 Difference]: With dead ends: 1563 [2025-01-09 15:36:27,023 INFO L226 Difference]: Without dead ends: 946 [2025-01-09 15:36:27,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:27,024 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 95 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:27,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 600 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:27,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states. [2025-01-09 15:36:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 701. [2025-01-09 15:36:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 633 states have (on average 1.4028436018957346) internal successors, (888), 635 states have internal predecessors, (888), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:36:27,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1008 transitions. [2025-01-09 15:36:27,061 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1008 transitions. Word has length 155 [2025-01-09 15:36:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:27,062 INFO L471 AbstractCegarLoop]: Abstraction has 701 states and 1008 transitions. [2025-01-09 15:36:27,062 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1008 transitions. [2025-01-09 15:36:27,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:27,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:27,063 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:27,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:36:27,064 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:27,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:27,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1211483657, now seen corresponding path program 1 times [2025-01-09 15:36:27,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:27,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266539274] [2025-01-09 15:36:27,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:27,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:27,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:27,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:27,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:27,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:27,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:27,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266539274] [2025-01-09 15:36:27,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266539274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:27,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:27,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:36:27,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714778111] [2025-01-09 15:36:27,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:27,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:36:27,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:27,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:36:27,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:27,803 INFO L87 Difference]: Start difference. First operand 701 states and 1008 transitions. Second operand has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:28,237 INFO L93 Difference]: Finished difference Result 1304 states and 1859 transitions. [2025-01-09 15:36:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:36:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:36:28,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:28,240 INFO L225 Difference]: With dead ends: 1304 [2025-01-09 15:36:28,240 INFO L226 Difference]: Without dead ends: 820 [2025-01-09 15:36:28,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:36:28,241 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 437 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:28,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 651 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:36:28,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-01-09 15:36:28,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 682. [2025-01-09 15:36:28,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 614 states have (on average 1.3859934853420195) internal successors, (851), 616 states have internal predecessors, (851), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:36:28,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 971 transitions. [2025-01-09 15:36:28,277 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 971 transitions. Word has length 155 [2025-01-09 15:36:28,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:28,278 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 971 transitions. [2025-01-09 15:36:28,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 971 transitions. [2025-01-09 15:36:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:28,279 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:28,279 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:28,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:36:28,279 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:28,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:28,279 INFO L85 PathProgramCache]: Analyzing trace with hash 145712945, now seen corresponding path program 1 times [2025-01-09 15:36:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:28,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201010915] [2025-01-09 15:36:28,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:28,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:28,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:28,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:28,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:28,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:28,549 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:28,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201010915] [2025-01-09 15:36:28,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201010915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:28,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831305700] [2025-01-09 15:36:28,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:28,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:28,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:28,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:28,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:28,551 INFO L87 Difference]: Start difference. First operand 682 states and 971 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:28,882 INFO L93 Difference]: Finished difference Result 1162 states and 1657 transitions. [2025-01-09 15:36:28,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:28,883 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:36:28,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:28,886 INFO L225 Difference]: With dead ends: 1162 [2025-01-09 15:36:28,887 INFO L226 Difference]: Without dead ends: 659 [2025-01-09 15:36:28,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:28,888 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 51 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:28,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 587 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:36:28,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-01-09 15:36:28,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2025-01-09 15:36:28,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 591 states have (on average 1.380710659898477) internal successors, (816), 593 states have internal predecessors, (816), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:36:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 936 transitions. [2025-01-09 15:36:28,991 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 936 transitions. Word has length 155 [2025-01-09 15:36:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:28,991 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 936 transitions. [2025-01-09 15:36:28,992 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), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:28,993 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 936 transitions. [2025-01-09 15:36:28,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:28,994 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:28,994 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:28,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:36:28,995 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:28,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:28,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1698324493, now seen corresponding path program 1 times [2025-01-09 15:36:28,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:28,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834716471] [2025-01-09 15:36:28,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:28,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:29,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:29,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:29,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:29,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:36,959 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:36,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:36,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834716471] [2025-01-09 15:36:36,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834716471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:36,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:36,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-01-09 15:36:36,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23883750] [2025-01-09 15:36:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:36,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 15:36:36,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:36,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 15:36:36,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:36:36,961 INFO L87 Difference]: Start difference. First operand 659 states and 936 transitions. Second operand has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:40,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:40,960 INFO L93 Difference]: Finished difference Result 1388 states and 1972 transitions. [2025-01-09 15:36:40,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 15:36:40,961 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:36:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:40,964 INFO L225 Difference]: With dead ends: 1388 [2025-01-09 15:36:40,964 INFO L226 Difference]: Without dead ends: 922 [2025-01-09 15:36:40,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=256, Invalid=1550, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 15:36:40,966 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 747 mSDsluCounter, 2693 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 2882 SdHoareTripleChecker+Invalid, 1945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:40,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 2882 Invalid, 1945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 15:36:40,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2025-01-09 15:36:40,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 674. [2025-01-09 15:36:41,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 606 states have (on average 1.3844884488448845) internal successors, (839), 608 states have internal predecessors, (839), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:36:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 959 transitions. [2025-01-09 15:36:41,002 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 959 transitions. Word has length 155 [2025-01-09 15:36:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:41,002 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 959 transitions. [2025-01-09 15:36:41,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.739130434782609) internal successors, (63), 24 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 959 transitions. [2025-01-09 15:36:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:41,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:41,003 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:41,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:36:41,003 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:41,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:41,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1667450099, now seen corresponding path program 1 times [2025-01-09 15:36:41,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:41,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625800934] [2025-01-09 15:36:41,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:41,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:41,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:41,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:41,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:41,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:42,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:42,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625800934] [2025-01-09 15:36:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625800934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:42,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:42,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:36:42,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366072280] [2025-01-09 15:36:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:42,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:36:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:42,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:36:42,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:36:42,045 INFO L87 Difference]: Start difference. First operand 674 states and 959 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:43,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:43,175 INFO L93 Difference]: Finished difference Result 1331 states and 1894 transitions. [2025-01-09 15:36:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:36:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:36:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:43,178 INFO L225 Difference]: With dead ends: 1331 [2025-01-09 15:36:43,178 INFO L226 Difference]: Without dead ends: 868 [2025-01-09 15:36:43,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=536, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:36:43,179 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 361 mSDsluCounter, 1960 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 2195 SdHoareTripleChecker+Invalid, 1286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:43,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 2195 Invalid, 1286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:36:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2025-01-09 15:36:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 744. [2025-01-09 15:36:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 676 states have (on average 1.3920118343195267) internal successors, (941), 678 states have internal predecessors, (941), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:36:43,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1061 transitions. [2025-01-09 15:36:43,220 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1061 transitions. Word has length 155 [2025-01-09 15:36:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:43,221 INFO L471 AbstractCegarLoop]: Abstraction has 744 states and 1061 transitions. [2025-01-09 15:36:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 17 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1061 transitions. [2025-01-09 15:36:43,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:43,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:43,222 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:43,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:36:43,222 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:43,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:43,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1925615537, now seen corresponding path program 1 times [2025-01-09 15:36:43,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:43,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039594962] [2025-01-09 15:36:43,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:43,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:43,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:43,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:43,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:43,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:43,967 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:43,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:43,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039594962] [2025-01-09 15:36:43,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039594962] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:43,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:43,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:36:43,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232087302] [2025-01-09 15:36:43,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:43,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:36:43,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:43,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:36:43,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:36:43,972 INFO L87 Difference]: Start difference. First operand 744 states and 1061 transitions. Second operand has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:44,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:44,555 INFO L93 Difference]: Finished difference Result 1456 states and 2078 transitions. [2025-01-09 15:36:44,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:44,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:36:44,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:44,559 INFO L225 Difference]: With dead ends: 1456 [2025-01-09 15:36:44,560 INFO L226 Difference]: Without dead ends: 923 [2025-01-09 15:36:44,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:44,562 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 459 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:44,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 1063 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:44,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2025-01-09 15:36:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 785. [2025-01-09 15:36:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 717 states have (on average 1.394700139470014) internal successors, (1000), 719 states have internal predecessors, (1000), 60 states have call successors, (60), 7 states have call predecessors, (60), 7 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 15:36:44,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1120 transitions. [2025-01-09 15:36:44,633 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1120 transitions. Word has length 155 [2025-01-09 15:36:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:44,634 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1120 transitions. [2025-01-09 15:36:44,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.3) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1120 transitions. [2025-01-09 15:36:44,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:44,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:44,635 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:44,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:36:44,636 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:44,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash 656332849, now seen corresponding path program 1 times [2025-01-09 15:36:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389869918] [2025-01-09 15:36:44,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:44,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:44,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:44,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:44,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:45,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:45,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389869918] [2025-01-09 15:36:45,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389869918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:45,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:45,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:36:45,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693399780] [2025-01-09 15:36:45,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:45,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:36:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:45,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:36:45,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:45,134 INFO L87 Difference]: Start difference. First operand 785 states and 1120 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:45,529 INFO L93 Difference]: Finished difference Result 1545 states and 2205 transitions. [2025-01-09 15:36:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:36:45,530 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-01-09 15:36:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:45,535 INFO L225 Difference]: With dead ends: 1545 [2025-01-09 15:36:45,535 INFO L226 Difference]: Without dead ends: 971 [2025-01-09 15:36:45,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:45,537 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 480 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:45,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 778 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:36:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2025-01-09 15:36:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 967. [2025-01-09 15:36:45,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 879 states have (on average 1.3879408418657566) internal successors, (1220), 883 states have internal predecessors, (1220), 78 states have call successors, (78), 9 states have call predecessors, (78), 9 states have return successors, (78), 74 states have call predecessors, (78), 78 states have call successors, (78) [2025-01-09 15:36:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1376 transitions. [2025-01-09 15:36:45,593 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1376 transitions. Word has length 155 [2025-01-09 15:36:45,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:45,594 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 1376 transitions. [2025-01-09 15:36:45,594 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:45,594 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1376 transitions. [2025-01-09 15:36:45,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:45,595 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:45,595 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:45,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:36:45,595 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:45,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:45,596 INFO L85 PathProgramCache]: Analyzing trace with hash -704289163, now seen corresponding path program 1 times [2025-01-09 15:36:45,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:45,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307204211] [2025-01-09 15:36:45,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:45,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:45,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:45,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:45,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:45,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307204211] [2025-01-09 15:36:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307204211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:36:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686475768] [2025-01-09 15:36:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:46,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:36:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:46,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:36:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:46,529 INFO L87 Difference]: Start difference. First operand 967 states and 1376 transitions. Second operand has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:47,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:47,086 INFO L93 Difference]: Finished difference Result 1855 states and 2633 transitions. [2025-01-09 15:36:47,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:47,087 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:36:47,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:47,090 INFO L225 Difference]: With dead ends: 1855 [2025-01-09 15:36:47,090 INFO L226 Difference]: Without dead ends: 1099 [2025-01-09 15:36:47,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:36:47,092 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 380 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:47,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 948 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:47,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2025-01-09 15:36:47,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 844. [2025-01-09 15:36:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 777 states have (on average 1.3912483912483913) internal successors, (1081), 779 states have internal predecessors, (1081), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:36:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 1197 transitions. [2025-01-09 15:36:47,176 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 1197 transitions. Word has length 155 [2025-01-09 15:36:47,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:47,176 INFO L471 AbstractCegarLoop]: Abstraction has 844 states and 1197 transitions. [2025-01-09 15:36:47,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 12 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 1197 transitions. [2025-01-09 15:36:47,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:47,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:47,177 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:47,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:36:47,178 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:47,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:47,178 INFO L85 PathProgramCache]: Analyzing trace with hash -446123725, now seen corresponding path program 1 times [2025-01-09 15:36:47,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:47,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119565547] [2025-01-09 15:36:47,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:47,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:47,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:47,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:47,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:47,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:48,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:48,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119565547] [2025-01-09 15:36:48,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119565547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:48,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:48,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:36:48,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288554620] [2025-01-09 15:36:48,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:48,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:36:48,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:48,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:36:48,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:36:48,534 INFO L87 Difference]: Start difference. First operand 844 states and 1197 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:49,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:49,784 INFO L93 Difference]: Finished difference Result 1561 states and 2209 transitions. [2025-01-09 15:36:49,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:36:49,787 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:36:49,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:49,790 INFO L225 Difference]: With dead ends: 1561 [2025-01-09 15:36:49,790 INFO L226 Difference]: Without dead ends: 928 [2025-01-09 15:36:49,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=673, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:36:49,791 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 363 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2288 SdHoareTripleChecker+Invalid, 1411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:49,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2288 Invalid, 1411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 15:36:49,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-01-09 15:36:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 840. [2025-01-09 15:36:49,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 840 states, 773 states have (on average 1.3906856403622252) internal successors, (1075), 775 states have internal predecessors, (1075), 58 states have call successors, (58), 8 states have call predecessors, (58), 8 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:36:49,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 1191 transitions. [2025-01-09 15:36:49,851 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 1191 transitions. Word has length 155 [2025-01-09 15:36:49,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:49,851 INFO L471 AbstractCegarLoop]: Abstraction has 840 states and 1191 transitions. [2025-01-09 15:36:49,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:36:49,851 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 1191 transitions. [2025-01-09 15:36:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:49,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:49,852 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:49,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:36:49,853 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:49,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:49,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1241313803, now seen corresponding path program 1 times [2025-01-09 15:36:49,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:49,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575432292] [2025-01-09 15:36:49,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:49,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:49,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:49,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:49,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:49,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:50,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:50,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575432292] [2025-01-09 15:36:50,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575432292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:50,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:50,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:36:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031467819] [2025-01-09 15:36:50,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:50,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:36:50,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:50,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:36:50,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:50,246 INFO L87 Difference]: Start difference. First operand 840 states and 1191 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:50,745 INFO L93 Difference]: Finished difference Result 1476 states and 2089 transitions. [2025-01-09 15:36:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:36:50,746 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 155 [2025-01-09 15:36:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:50,749 INFO L225 Difference]: With dead ends: 1476 [2025-01-09 15:36:50,749 INFO L226 Difference]: Without dead ends: 847 [2025-01-09 15:36:50,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:50,750 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 380 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:50,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 783 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:36:50,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2025-01-09 15:36:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 680. [2025-01-09 15:36:50,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 635 states have (on average 1.4) internal successors, (889), 635 states have internal predecessors, (889), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 965 transitions. [2025-01-09 15:36:50,829 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 965 transitions. Word has length 155 [2025-01-09 15:36:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:50,829 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 965 transitions. [2025-01-09 15:36:50,830 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), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 965 transitions. [2025-01-09 15:36:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:50,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:50,831 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:50,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:36:50,831 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:50,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:50,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2042536243, now seen corresponding path program 1 times [2025-01-09 15:36:50,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:50,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182713209] [2025-01-09 15:36:50,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:50,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:50,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:50,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182713209] [2025-01-09 15:36:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182713209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:51,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:51,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 15:36:51,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205161520] [2025-01-09 15:36:51,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:51,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 15:36:51,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:51,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 15:36:51,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:36:51,782 INFO L87 Difference]: Start difference. First operand 680 states and 965 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:52,727 INFO L93 Difference]: Finished difference Result 1231 states and 1744 transitions. [2025-01-09 15:36:52,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:36:52,727 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:36:52,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:52,730 INFO L225 Difference]: With dead ends: 1231 [2025-01-09 15:36:52,733 INFO L226 Difference]: Without dead ends: 762 [2025-01-09 15:36:52,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2025-01-09 15:36:52,740 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 319 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:52,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 2359 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:36:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2025-01-09 15:36:52,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 676. [2025-01-09 15:36:52,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 631 states have (on average 1.4025356576862125) internal successors, (885), 631 states have internal predecessors, (885), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:52,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 961 transitions. [2025-01-09 15:36:52,780 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 961 transitions. Word has length 155 [2025-01-09 15:36:52,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:52,780 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 961 transitions. [2025-01-09 15:36:52,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 961 transitions. [2025-01-09 15:36:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:36:52,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:52,784 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:52,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:36:52,784 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:52,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash -71037581, now seen corresponding path program 1 times [2025-01-09 15:36:52,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:52,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937542683] [2025-01-09 15:36:52,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:52,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:52,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:36:52,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:36:52,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:52,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:53,602 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:53,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:53,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937542683] [2025-01-09 15:36:53,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937542683] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:53,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:53,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 15:36:53,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802976162] [2025-01-09 15:36:53,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:53,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:36:53,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:53,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:36:53,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:36:53,604 INFO L87 Difference]: Start difference. First operand 676 states and 961 transitions. Second operand has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:54,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:54,600 INFO L93 Difference]: Finished difference Result 1221 states and 1734 transitions. [2025-01-09 15:36:54,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:36:54,600 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 155 [2025-01-09 15:36:54,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:54,603 INFO L225 Difference]: With dead ends: 1221 [2025-01-09 15:36:54,604 INFO L226 Difference]: Without dead ends: 756 [2025-01-09 15:36:54,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2025-01-09 15:36:54,605 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 322 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 2167 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:54,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 2167 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:36:54,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2025-01-09 15:36:54,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 670. [2025-01-09 15:36:54,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 625 states have (on average 1.4064) internal successors, (879), 625 states have internal predecessors, (879), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 955 transitions. [2025-01-09 15:36:54,644 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 955 transitions. Word has length 155 [2025-01-09 15:36:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:54,644 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 955 transitions. [2025-01-09 15:36:54,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 17 states have internal predecessors, (63), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 955 transitions. [2025-01-09 15:36:54,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:36:54,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:54,646 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:54,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:36:54,646 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:54,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:54,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1670210143, now seen corresponding path program 1 times [2025-01-09 15:36:54,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:54,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769623988] [2025-01-09 15:36:54,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:54,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:54,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:36:54,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:36:54,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:54,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:54,687 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:54,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:54,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769623988] [2025-01-09 15:36:54,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769623988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:54,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:54,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:36:54,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244398151] [2025-01-09 15:36:54,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:54,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:36:54,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:54,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:36:54,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:54,688 INFO L87 Difference]: Start difference. First operand 670 states and 955 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:54,734 INFO L93 Difference]: Finished difference Result 1137 states and 1625 transitions. [2025-01-09 15:36:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:36:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-01-09 15:36:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:54,737 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 15:36:54,738 INFO L226 Difference]: Without dead ends: 673 [2025-01-09 15:36:54,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:54,739 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:54,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-01-09 15:36:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-01-09 15:36:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 628 states have (on average 1.4044585987261147) internal successors, (882), 628 states have internal predecessors, (882), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 958 transitions. [2025-01-09 15:36:54,778 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 958 transitions. Word has length 156 [2025-01-09 15:36:54,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:54,779 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 958 transitions. [2025-01-09 15:36:54,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:54,779 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 958 transitions. [2025-01-09 15:36:54,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:36:54,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:54,780 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:54,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:36:54,780 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:54,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1928375581, now seen corresponding path program 1 times [2025-01-09 15:36:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:54,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152681730] [2025-01-09 15:36:54,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:54,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:36:54,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:36:54,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:54,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:54,898 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:36:54,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:54,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152681730] [2025-01-09 15:36:54,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152681730] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:36:54,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814788818] [2025-01-09 15:36:54,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:54,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:36:54,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:36:54,900 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:36:54,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:36:55,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:36:55,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:36:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:55,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:55,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:36:55,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:36:55,145 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:55,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:36:55,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814788818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:55,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:36:55,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:36:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578334701] [2025-01-09 15:36:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:55,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:36:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:55,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:36:55,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:55,146 INFO L87 Difference]: Start difference. First operand 673 states and 958 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:55,200 INFO L93 Difference]: Finished difference Result 1146 states and 1632 transitions. [2025-01-09 15:36:55,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:36:55,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-01-09 15:36:55,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:55,202 INFO L225 Difference]: With dead ends: 1146 [2025-01-09 15:36:55,202 INFO L226 Difference]: Without dead ends: 685 [2025-01-09 15:36:55,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:36:55,203 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:55,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2025-01-09 15:36:55,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 676. [2025-01-09 15:36:55,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 631 states have (on average 1.4025356576862125) internal successors, (885), 631 states have internal predecessors, (885), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:55,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 961 transitions. [2025-01-09 15:36:55,241 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 961 transitions. Word has length 156 [2025-01-09 15:36:55,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:55,242 INFO L471 AbstractCegarLoop]: Abstraction has 676 states and 961 transitions. [2025-01-09 15:36:55,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:55,242 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 961 transitions. [2025-01-09 15:36:55,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:36:55,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:55,242 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:55,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:36:55,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:36:55,443 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash 444375514, now seen corresponding path program 1 times [2025-01-09 15:36:55,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:55,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939433785] [2025-01-09 15:36:55,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:55,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:55,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:36:55,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:36:55,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:55,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939433785] [2025-01-09 15:36:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939433785] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:36:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720659162] [2025-01-09 15:36:55,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:55,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:36:55,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:55,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:36:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:36:55,564 INFO L87 Difference]: Start difference. First operand 676 states and 961 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:55,664 INFO L93 Difference]: Finished difference Result 1342 states and 1849 transitions. [2025-01-09 15:36:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:36:55,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-01-09 15:36:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:55,670 INFO L225 Difference]: With dead ends: 1342 [2025-01-09 15:36:55,670 INFO L226 Difference]: Without dead ends: 871 [2025-01-09 15:36:55,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:36:55,671 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 53 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:55,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 631 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-01-09 15:36:55,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 829. [2025-01-09 15:36:55,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 784 states have (on average 1.3303571428571428) internal successors, (1043), 784 states have internal predecessors, (1043), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:55,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1119 transitions. [2025-01-09 15:36:55,713 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1119 transitions. Word has length 158 [2025-01-09 15:36:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:55,713 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1119 transitions. [2025-01-09 15:36:55,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1119 transitions. [2025-01-09 15:36:55,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:36:55,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:55,714 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:55,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 15:36:55,714 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2068031103, now seen corresponding path program 1 times [2025-01-09 15:36:55,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:55,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548778535] [2025-01-09 15:36:55,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:55,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:36:55,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:36:55,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:55,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:55,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:55,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548778535] [2025-01-09 15:36:55,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548778535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:55,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:55,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:36:55,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061506626] [2025-01-09 15:36:55,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:55,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:36:55,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:55,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:36:55,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:55,757 INFO L87 Difference]: Start difference. First operand 829 states and 1119 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:55,811 INFO L93 Difference]: Finished difference Result 1405 states and 1898 transitions. [2025-01-09 15:36:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:36:55,811 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-01-09 15:36:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:55,813 INFO L225 Difference]: With dead ends: 1405 [2025-01-09 15:36:55,813 INFO L226 Difference]: Without dead ends: 830 [2025-01-09 15:36:55,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:55,814 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:55,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-01-09 15:36:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2025-01-09 15:36:55,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 785 states have (on average 1.329936305732484) internal successors, (1044), 785 states have internal predecessors, (1044), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:55,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1120 transitions. [2025-01-09 15:36:55,854 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1120 transitions. Word has length 158 [2025-01-09 15:36:55,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:55,854 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1120 transitions. [2025-01-09 15:36:55,854 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1120 transitions. [2025-01-09 15:36:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:36:55,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:55,858 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:55,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 15:36:55,858 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:55,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:55,859 INFO L85 PathProgramCache]: Analyzing trace with hash -451928831, now seen corresponding path program 1 times [2025-01-09 15:36:55,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:55,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425477285] [2025-01-09 15:36:55,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:55,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:55,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:36:55,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:36:55,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:55,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:56,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:56,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425477285] [2025-01-09 15:36:56,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425477285] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:56,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:56,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:36:56,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182451051] [2025-01-09 15:36:56,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:56,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:36:56,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:56,382 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:36:56,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:56,382 INFO L87 Difference]: Start difference. First operand 830 states and 1120 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:56,588 INFO L93 Difference]: Finished difference Result 1312 states and 1720 transitions. [2025-01-09 15:36:56,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:36:56,588 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-01-09 15:36:56,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:56,591 INFO L225 Difference]: With dead ends: 1312 [2025-01-09 15:36:56,591 INFO L226 Difference]: Without dead ends: 1310 [2025-01-09 15:36:56,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:36:56,591 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 259 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:56,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 953 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:36:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-01-09 15:36:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1294. [2025-01-09 15:36:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1249 states have (on average 1.299439551641313) internal successors, (1623), 1249 states have internal predecessors, (1623), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1699 transitions. [2025-01-09 15:36:56,634 INFO L78 Accepts]: Start accepts. Automaton has 1294 states and 1699 transitions. Word has length 158 [2025-01-09 15:36:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:56,637 INFO L471 AbstractCegarLoop]: Abstraction has 1294 states and 1699 transitions. [2025-01-09 15:36:56,638 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1294 states and 1699 transitions. [2025-01-09 15:36:56,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 15:36:56,639 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:56,639 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:56,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 15:36:56,639 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash 202397395, now seen corresponding path program 1 times [2025-01-09 15:36:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248889180] [2025-01-09 15:36:56,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:56,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 15:36:56,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 15:36:56,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:56,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:57,350 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:57,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:57,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248889180] [2025-01-09 15:36:57,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248889180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:57,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:57,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:36:57,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751732119] [2025-01-09 15:36:57,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:57,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:36:57,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:57,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:36:57,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:36:57,353 INFO L87 Difference]: Start difference. First operand 1294 states and 1699 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:57,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:57,870 INFO L93 Difference]: Finished difference Result 2283 states and 2997 transitions. [2025-01-09 15:36:57,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:36:57,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 159 [2025-01-09 15:36:57,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:57,876 INFO L225 Difference]: With dead ends: 2283 [2025-01-09 15:36:57,876 INFO L226 Difference]: Without dead ends: 1367 [2025-01-09 15:36:57,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:36:57,877 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 600 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:57,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 990 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:36:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2025-01-09 15:36:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1166. [2025-01-09 15:36:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1121 states have (on average 1.296164139161463) internal successors, (1453), 1121 states have internal predecessors, (1453), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 1529 transitions. [2025-01-09 15:36:57,966 INFO L78 Accepts]: Start accepts. Automaton has 1166 states and 1529 transitions. Word has length 159 [2025-01-09 15:36:57,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:57,966 INFO L471 AbstractCegarLoop]: Abstraction has 1166 states and 1529 transitions. [2025-01-09 15:36:57,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:36:57,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1166 states and 1529 transitions. [2025-01-09 15:36:57,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:36:57,967 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:57,967 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:57,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 15:36:57,969 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:57,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:57,970 INFO L85 PathProgramCache]: Analyzing trace with hash 907894501, now seen corresponding path program 1 times [2025-01-09 15:36:57,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:57,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811252428] [2025-01-09 15:36:57,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:57,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:36:58,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:36:58,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:58,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811252428] [2025-01-09 15:36:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811252428] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:36:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763219822] [2025-01-09 15:36:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:36:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:58,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:36:58,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:58,707 INFO L87 Difference]: Start difference. First operand 1166 states and 1529 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:58,995 INFO L93 Difference]: Finished difference Result 2988 states and 3898 transitions. [2025-01-09 15:36:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:36:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 160 [2025-01-09 15:36:58,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:58,999 INFO L225 Difference]: With dead ends: 2988 [2025-01-09 15:36:58,999 INFO L226 Difference]: Without dead ends: 2074 [2025-01-09 15:36:59,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:36:59,000 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 246 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:59,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 930 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:36:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2074 states. [2025-01-09 15:36:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2074 to 1652. [2025-01-09 15:36:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1607 states have (on average 1.3049159925326697) internal successors, (2097), 1607 states have internal predecessors, (2097), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2173 transitions. [2025-01-09 15:36:59,063 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2173 transitions. Word has length 160 [2025-01-09 15:36:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:59,064 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2173 transitions. [2025-01-09 15:36:59,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:36:59,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2173 transitions. [2025-01-09 15:36:59,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:36:59,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:59,065 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:59,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 15:36:59,066 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:59,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:59,066 INFO L85 PathProgramCache]: Analyzing trace with hash 764170496, now seen corresponding path program 1 times [2025-01-09 15:36:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:59,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953794371] [2025-01-09 15:36:59,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:59,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:59,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:36:59,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:36:59,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:59,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:59,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:59,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953794371] [2025-01-09 15:36:59,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953794371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:59,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:59,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:36:59,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664590458] [2025-01-09 15:36:59,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:59,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:36:59,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:59,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:36:59,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:59,105 INFO L87 Difference]: Start difference. First operand 1652 states and 2173 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:59,149 INFO L93 Difference]: Finished difference Result 3102 states and 4099 transitions. [2025-01-09 15:36:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:36:59,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-01-09 15:36:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:59,154 INFO L225 Difference]: With dead ends: 3102 [2025-01-09 15:36:59,154 INFO L226 Difference]: Without dead ends: 1712 [2025-01-09 15:36:59,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:36:59,157 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:59,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:59,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2025-01-09 15:36:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1712. [2025-01-09 15:36:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1667 states have (on average 1.2939412117576485) internal successors, (2157), 1667 states have internal predecessors, (2157), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2233 transitions. [2025-01-09 15:36:59,206 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2233 transitions. Word has length 160 [2025-01-09 15:36:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:59,206 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2233 transitions. [2025-01-09 15:36:59,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2233 transitions. [2025-01-09 15:36:59,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:36:59,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:59,207 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:59,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 15:36:59,208 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 904719106, now seen corresponding path program 1 times [2025-01-09 15:36:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:59,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736312792] [2025-01-09 15:36:59,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:59,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:36:59,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:36:59,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:59,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:59,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736312792] [2025-01-09 15:36:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736312792] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:59,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:36:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002948384] [2025-01-09 15:36:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:59,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:36:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:59,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:36:59,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:36:59,313 INFO L87 Difference]: Start difference. First operand 1712 states and 2233 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:59,361 INFO L93 Difference]: Finished difference Result 3114 states and 4015 transitions. [2025-01-09 15:36:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:36:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-01-09 15:36:59,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:59,364 INFO L225 Difference]: With dead ends: 3114 [2025-01-09 15:36:59,364 INFO L226 Difference]: Without dead ends: 1652 [2025-01-09 15:36:59,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:36:59,367 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:59,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:36:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2025-01-09 15:36:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2025-01-09 15:36:59,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1607 states have (on average 1.2302426882389546) internal successors, (1977), 1607 states have internal predecessors, (1977), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:59,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2053 transitions. [2025-01-09 15:36:59,416 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2053 transitions. Word has length 160 [2025-01-09 15:36:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:59,416 INFO L471 AbstractCegarLoop]: Abstraction has 1652 states and 2053 transitions. [2025-01-09 15:36:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2053 transitions. [2025-01-09 15:36:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:36:59,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:59,419 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 15:36:59,419 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:59,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2000869401, now seen corresponding path program 1 times [2025-01-09 15:36:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794619917] [2025-01-09 15:36:59,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:59,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:36:59,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:36:59,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:36:59,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:36:59,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:36:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:36:59,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:36:59,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794619917] [2025-01-09 15:36:59,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794619917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:36:59,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:36:59,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:36:59,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254611683] [2025-01-09 15:36:59,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:36:59,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:36:59,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:36:59,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:36:59,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:36:59,678 INFO L87 Difference]: Start difference. First operand 1652 states and 2053 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:36:59,900 INFO L93 Difference]: Finished difference Result 3387 states and 4171 transitions. [2025-01-09 15:36:59,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:36:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-01-09 15:36:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:36:59,904 INFO L225 Difference]: With dead ends: 3387 [2025-01-09 15:36:59,904 INFO L226 Difference]: Without dead ends: 2075 [2025-01-09 15:36:59,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:36:59,906 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 196 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:36:59,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 783 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:36:59,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2025-01-09 15:36:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 1651. [2025-01-09 15:36:59,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1606 states have (on average 1.229763387297634) internal successors, (1975), 1606 states have internal predecessors, (1975), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:36:59,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2051 transitions. [2025-01-09 15:36:59,977 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2051 transitions. Word has length 160 [2025-01-09 15:36:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:36:59,978 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2051 transitions. [2025-01-09 15:36:59,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:36:59,978 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2051 transitions. [2025-01-09 15:36:59,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:36:59,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:36:59,980 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:36:59,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 15:36:59,981 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:36:59,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:36:59,981 INFO L85 PathProgramCache]: Analyzing trace with hash -412215250, now seen corresponding path program 1 times [2025-01-09 15:36:59,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:36:59,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615225848] [2025-01-09 15:36:59,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:36:59,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:00,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:00,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:00,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:00,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:00,394 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:37:00,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:00,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615225848] [2025-01-09 15:37:00,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615225848] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:00,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:00,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:37:00,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179721336] [2025-01-09 15:37:00,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:00,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:00,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:00,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:00,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:37:00,397 INFO L87 Difference]: Start difference. First operand 1651 states and 2051 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:37:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:00,744 INFO L93 Difference]: Finished difference Result 3075 states and 3815 transitions. [2025-01-09 15:37:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:37:00,745 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 161 [2025-01-09 15:37:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:00,749 INFO L225 Difference]: With dead ends: 3075 [2025-01-09 15:37:00,749 INFO L226 Difference]: Without dead ends: 1725 [2025-01-09 15:37:00,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:37:00,751 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 318 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:00,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 506 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1725 states. [2025-01-09 15:37:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1725 to 1651. [2025-01-09 15:37:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1651 states, 1606 states have (on average 1.2110834371108343) internal successors, (1945), 1606 states have internal predecessors, (1945), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1651 states to 1651 states and 2021 transitions. [2025-01-09 15:37:00,829 INFO L78 Accepts]: Start accepts. Automaton has 1651 states and 2021 transitions. Word has length 161 [2025-01-09 15:37:00,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:00,830 INFO L471 AbstractCegarLoop]: Abstraction has 1651 states and 2021 transitions. [2025-01-09 15:37:00,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:37:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1651 states and 2021 transitions. [2025-01-09 15:37:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:37:00,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:00,832 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:00,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 15:37:00,832 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -546228756, now seen corresponding path program 1 times [2025-01-09 15:37:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112191849] [2025-01-09 15:37:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:00,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:00,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:00,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:00,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:01,721 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:37:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112191849] [2025-01-09 15:37:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112191849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:01,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:37:01,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406347137] [2025-01-09 15:37:01,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:01,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:37:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:37:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:37:01,724 INFO L87 Difference]: Start difference. First operand 1651 states and 2021 transitions. Second operand has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:37:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:02,524 INFO L93 Difference]: Finished difference Result 3326 states and 4084 transitions. [2025-01-09 15:37:02,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:37:02,524 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 161 [2025-01-09 15:37:02,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:02,527 INFO L225 Difference]: With dead ends: 3326 [2025-01-09 15:37:02,527 INFO L226 Difference]: Without dead ends: 2015 [2025-01-09 15:37:02,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:37:02,529 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 996 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:02,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1069 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:37:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2025-01-09 15:37:02,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1693. [2025-01-09 15:37:02,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1693 states, 1648 states have (on average 1.2129854368932038) internal successors, (1999), 1648 states have internal predecessors, (1999), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1693 states to 1693 states and 2075 transitions. [2025-01-09 15:37:02,581 INFO L78 Accepts]: Start accepts. Automaton has 1693 states and 2075 transitions. Word has length 161 [2025-01-09 15:37:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:02,581 INFO L471 AbstractCegarLoop]: Abstraction has 1693 states and 2075 transitions. [2025-01-09 15:37:02,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.928571428571429) internal successors, (69), 15 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:37:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 1693 states and 2075 transitions. [2025-01-09 15:37:02,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:37:02,583 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:02,583 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:02,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 15:37:02,583 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:02,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:02,583 INFO L85 PathProgramCache]: Analyzing trace with hash -288063318, now seen corresponding path program 1 times [2025-01-09 15:37:02,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:02,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876528832] [2025-01-09 15:37:02,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:02,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:02,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:02,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:02,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:02,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:02,706 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:37:02,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:02,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876528832] [2025-01-09 15:37:02,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876528832] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:02,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834830574] [2025-01-09 15:37:02,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:02,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:02,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:02,709 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:37:02,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:37:02,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:02,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:02,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:02,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:02,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:37:02,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:37:03,003 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:37:03,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834830574] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:03,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:37:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-01-09 15:37:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755451290] [2025-01-09 15:37:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:37:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:03,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:37:03,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:03,004 INFO L87 Difference]: Start difference. First operand 1693 states and 2075 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:37:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:03,080 INFO L93 Difference]: Finished difference Result 3073 states and 3768 transitions. [2025-01-09 15:37:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:03,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-01-09 15:37:03,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:03,083 INFO L225 Difference]: With dead ends: 3073 [2025-01-09 15:37:03,083 INFO L226 Difference]: Without dead ends: 1723 [2025-01-09 15:37:03,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:03,084 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:03,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:37:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2025-01-09 15:37:03,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1699. [2025-01-09 15:37:03,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1654 states have (on average 1.2122128174123337) internal successors, (2005), 1654 states have internal predecessors, (2005), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:03,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2081 transitions. [2025-01-09 15:37:03,136 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2081 transitions. Word has length 161 [2025-01-09 15:37:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:03,137 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2081 transitions. [2025-01-09 15:37:03,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:37:03,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2081 transitions. [2025-01-09 15:37:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:37:03,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:03,138 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:03,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:37:03,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2025-01-09 15:37:03,339 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:03,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:03,340 INFO L85 PathProgramCache]: Analyzing trace with hash 58766473, now seen corresponding path program 1 times [2025-01-09 15:37:03,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:03,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692866343] [2025-01-09 15:37:03,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:03,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:03,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:03,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:37:03,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:03,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692866343] [2025-01-09 15:37:03,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692866343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:03,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:03,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:37:03,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847148865] [2025-01-09 15:37:03,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:03,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:37:03,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:03,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:37:03,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:03,811 INFO L87 Difference]: Start difference. First operand 1699 states and 2081 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:37:04,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:04,069 INFO L93 Difference]: Finished difference Result 3071 states and 3763 transitions. [2025-01-09 15:37:04,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:37:04,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 161 [2025-01-09 15:37:04,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:04,072 INFO L225 Difference]: With dead ends: 3071 [2025-01-09 15:37:04,072 INFO L226 Difference]: Without dead ends: 1715 [2025-01-09 15:37:04,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:37:04,074 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 407 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:04,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 755 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:37:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1715 states. [2025-01-09 15:37:04,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1715 to 1699. [2025-01-09 15:37:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1654 states have (on average 1.2110036275695284) internal successors, (2003), 1654 states have internal predecessors, (2003), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2079 transitions. [2025-01-09 15:37:04,123 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2079 transitions. Word has length 161 [2025-01-09 15:37:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:04,123 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2079 transitions. [2025-01-09 15:37:04,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 9 states have internal predecessors, (69), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:37:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2079 transitions. [2025-01-09 15:37:04,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:37:04,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:04,125 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:04,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 15:37:04,125 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:04,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:04,126 INFO L85 PathProgramCache]: Analyzing trace with hash -334260537, now seen corresponding path program 1 times [2025-01-09 15:37:04,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:04,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684323514] [2025-01-09 15:37:04,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:04,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:04,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:04,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:04,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:04,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:37:04,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684323514] [2025-01-09 15:37:04,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684323514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:04,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:04,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:37:04,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770490278] [2025-01-09 15:37:04,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:04,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:37:04,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:04,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:37:04,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:37:04,374 INFO L87 Difference]: Start difference. First operand 1699 states and 2079 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:37:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:04,558 INFO L93 Difference]: Finished difference Result 3063 states and 3748 transitions. [2025-01-09 15:37:04,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:37:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-01-09 15:37:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:04,561 INFO L225 Difference]: With dead ends: 3063 [2025-01-09 15:37:04,562 INFO L226 Difference]: Without dead ends: 1707 [2025-01-09 15:37:04,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:37:04,563 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 287 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:04,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 538 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:37:04,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2025-01-09 15:37:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1699. [2025-01-09 15:37:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1699 states, 1654 states have (on average 1.2103990326481258) internal successors, (2002), 1654 states have internal predecessors, (2002), 38 states have call successors, (38), 6 states have call predecessors, (38), 6 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:37:04,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2078 transitions. [2025-01-09 15:37:04,613 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2078 transitions. Word has length 161 [2025-01-09 15:37:04,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:04,613 INFO L471 AbstractCegarLoop]: Abstraction has 1699 states and 2078 transitions. [2025-01-09 15:37:04,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:37:04,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2078 transitions. [2025-01-09 15:37:04,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:37:04,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:04,615 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:04,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 15:37:04,615 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:04,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:04,616 INFO L85 PathProgramCache]: Analyzing trace with hash -137455636, now seen corresponding path program 1 times [2025-01-09 15:37:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842727240] [2025-01-09 15:37:04,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:04,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:04,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:04,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:04,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:04,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:37:05,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842727240] [2025-01-09 15:37:05,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842727240] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:05,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588647651] [2025-01-09 15:37:05,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:05,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:37:05,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:05,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:37:05,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:37:05,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:37:05,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:37:05,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:05,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:05,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 15:37:05,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:37:05,649 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 [2025-01-09 15:37:05,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-01-09 15:37:06,256 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-01-09 15:37:06,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 20 [2025-01-09 15:37:06,279 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 15:37:06,279 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 28 treesize of output 12 [2025-01-09 15:37:06,295 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 312 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-01-09 15:37:06,295 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:37:06,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588647651] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:37:06,523 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:37:06,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 19 [2025-01-09 15:37:06,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411153936] [2025-01-09 15:37:06,523 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:37:06,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:37:06,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:06,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:37:06,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:37:06,524 INFO L87 Difference]: Start difference. First operand 1699 states and 2078 transitions. Second operand has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2025-01-09 15:37:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:07,225 INFO L93 Difference]: Finished difference Result 3388 states and 4114 transitions. [2025-01-09 15:37:07,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:37:07,225 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 161 [2025-01-09 15:37:07,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:07,228 INFO L225 Difference]: With dead ends: 3388 [2025-01-09 15:37:07,228 INFO L226 Difference]: Without dead ends: 1915 [2025-01-09 15:37:07,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 276 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=901, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 15:37:07,231 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 756 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:07,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1254 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:37:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1915 states. [2025-01-09 15:37:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1915 to 1900. [2025-01-09 15:37:07,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1849 states have (on average 1.1752298539751216) internal successors, (2173), 1850 states have internal predecessors, (2173), 42 states have call successors, (42), 8 states have call predecessors, (42), 8 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 15:37:07,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2257 transitions. [2025-01-09 15:37:07,300 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2257 transitions. Word has length 161 [2025-01-09 15:37:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:07,300 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2257 transitions. [2025-01-09 15:37:07,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 7.176470588235294) internal successors, (122), 17 states have internal predecessors, (122), 6 states have call successors, (38), 3 states have call predecessors, (38), 5 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2025-01-09 15:37:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2257 transitions. [2025-01-09 15:37:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 15:37:07,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:07,302 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:07,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:37:07,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-01-09 15:37:07,506 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:07,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 424114213, now seen corresponding path program 1 times [2025-01-09 15:37:07,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:07,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107062863] [2025-01-09 15:37:07,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:07,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:07,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:37:07,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:37:07,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:07,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:37:08,081 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:37:08,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:37:08,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107062863] [2025-01-09 15:37:08,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107062863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:37:08,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:37:08,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:37:08,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429441416] [2025-01-09 15:37:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:37:08,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:37:08,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:37:08,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:37:08,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:37:08,083 INFO L87 Difference]: Start difference. First operand 1900 states and 2257 transitions. Second operand has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:37:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:37:08,619 INFO L93 Difference]: Finished difference Result 1973 states and 2341 transitions. [2025-01-09 15:37:08,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 15:37:08,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2025-01-09 15:37:08,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:37:08,622 INFO L225 Difference]: With dead ends: 1973 [2025-01-09 15:37:08,622 INFO L226 Difference]: Without dead ends: 1971 [2025-01-09 15:37:08,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-01-09 15:37:08,623 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 436 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1741 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:37:08,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1741 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:37:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1971 states. [2025-01-09 15:37:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1971 to 1966. [2025-01-09 15:37:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1912 states have (on average 1.1757322175732217) internal successors, (2248), 1914 states have internal predecessors, (2248), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 15:37:08,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2336 transitions. [2025-01-09 15:37:08,703 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2336 transitions. Word has length 163 [2025-01-09 15:37:08,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:37:08,704 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2336 transitions. [2025-01-09 15:37:08,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.461538461538462) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:37:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2336 transitions. [2025-01-09 15:37:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 15:37:08,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:08,705 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:08,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 15:37:08,706 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:08,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:08,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2004116488, now seen corresponding path program 1 times [2025-01-09 15:37:08,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:37:08,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934345099] [2025-01-09 15:37:08,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:08,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:37:08,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:37:08,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:37:08,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:08,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:37:08,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:37:08,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:37:08,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:37:08,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:37:08,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:37:08,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:37:08,855 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:37:08,856 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:37:08,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 15:37:08,859 INFO L422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:09,005 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:37:09,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:37:09 BoogieIcfgContainer [2025-01-09 15:37:09,007 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:37:09,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:37:09,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:37:09,008 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:37:09,008 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:35:58" (3/4) ... [2025-01-09 15:37:09,010 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:37:09,011 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:37:09,011 INFO L158 Benchmark]: Toolchain (without parser) took 71363.63ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 105.0MB in the beginning and 751.9MB in the end (delta: -646.9MB). Peak memory consumption was 498.2MB. Max. memory is 16.1GB. [2025-01-09 15:37:09,011 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:37:09,012 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.10ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 89.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:37:09,012 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.15ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 84.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:37:09,012 INFO L158 Benchmark]: Boogie Preprocessor took 73.75ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 79.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:37:09,012 INFO L158 Benchmark]: RCFGBuilder took 592.21ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 38.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 15:37:09,012 INFO L158 Benchmark]: TraceAbstraction took 70381.63ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 37.1MB in the beginning and 752.2MB in the end (delta: -715.1MB). Peak memory consumption was 422.7MB. Max. memory is 16.1GB. [2025-01-09 15:37:09,012 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 1.3GB. Free memory was 752.2MB in the beginning and 751.9MB in the end (delta: 267.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:37:09,013 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.22ms. Allocated memory is still 201.3MB. Free memory is still 128.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.10ms. Allocated memory is still 142.6MB. Free memory was 105.0MB in the beginning and 89.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.15ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 84.7MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.75ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 79.9MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 592.21ms. Allocated memory is still 142.6MB. Free memory was 79.9MB in the beginning and 38.0MB in the end (delta: 41.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 70381.63ms. Allocated memory was 142.6MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 37.1MB in the beginning and 752.2MB in the end (delta: -715.1MB). Peak memory consumption was 422.7MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 1.3GB. Free memory was 752.2MB in the beginning and 751.9MB in the end (delta: 267.2kB). Peak memory consumption was 8.4MB. 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 someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[5] = { 0, 0, 0, 0, 1 }; [L25] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer = &(BOOL_unsigned_char_Array_0[0]); [L26] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer = &(BOOL_unsigned_char_Array_0[1]); [L27] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer = &(BOOL_unsigned_char_Array_0[2]); [L28] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer = &(BOOL_unsigned_char_Array_0[3]); [L29] unsigned char* BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer = &(BOOL_unsigned_char_Array_0[4]); [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L30-L32] double double_Array_0[2] = { 10.5, 99.25 }; [L33] double* double_Array_0_arraydouble_Array_0arrayVar0_Pointer = &(double_Array_0[0]); [L34] double* double_Array_0_arraydouble_Array_0arrayVar1_Pointer = &(double_Array_0[1]); [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L35-L37] signed char signed_char_Array_0[1] = { 0 }; [L38] signed char* signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer = &(signed_char_Array_0[0]); [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L39-L41] unsigned char unsigned_char_Array_0[2][3] = { {8, 64, 128}, {2, 16, 1} }; [L42] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer = &(unsigned_char_Array_0[0][0]); [L43] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer = &(unsigned_char_Array_0[1][0]); [L44] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer = &(unsigned_char_Array_0[0][1]); [L45] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer = &(unsigned_char_Array_0[1][1]); [L46] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer = &(unsigned_char_Array_0[0][2]); [L47] unsigned char* unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer = &(unsigned_char_Array_0[1][2]); [L48] unsigned char last_1_unsigned_char_Array_0_0__1_ = 64; VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=0, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L122] isInitial = 1 [L123] FCALL initially() [L125] CALL updateLastVariables() [L115] EXPR unsigned_char_Array_0[0][1] [L115] last_1_unsigned_char_Array_0_0__1_ = unsigned_char_Array_0[0][1] [L125] RET updateLastVariables() [L126] CALL updateVariables() [L84] BOOL_unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L85] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L86] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L87] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L88] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L88] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L89] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L90] BOOL_unsigned_char_Array_0[3] = __VERIFIER_nondet_uchar() [L91] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L91] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] EXPR BOOL_unsigned_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L92] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[3] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L93] BOOL_unsigned_char_Array_0[4] = __VERIFIER_nondet_uchar() [L94] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L94] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] EXPR BOOL_unsigned_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L95] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[4] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L96] double_Array_0[1] = __VERIFIER_nondet_double() [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L97] EXPR double_Array_0[1] [L97] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L97] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L98] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L99] EXPR signed_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] CALL assume_abort_if_not(signed_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L99] RET assume_abort_if_not(signed_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] EXPR signed_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] CALL assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L100] RET assume_abort_if_not(signed_char_Array_0[0] <= 16) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L101] unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L102] EXPR 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L102] RET assume_abort_if_not(unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] EXPR 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] CALL assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L103] RET assume_abort_if_not(unsigned_char_Array_0[0][0] <= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L104] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L105] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L105] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] EXPR unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L106] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L107] unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L108] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L108] RET assume_abort_if_not(unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] EXPR unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] CALL assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L109] RET assume_abort_if_not(unsigned_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L110] unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L111] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L111] RET assume_abort_if_not(unsigned_char_Array_0[0][2] >= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] EXPR unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] CALL assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, \old(cond)=1, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L112] RET assume_abort_if_not(unsigned_char_Array_0[0][2] <= 254) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L126] RET updateVariables() [L127] CALL step() [L52] EXPR \read(*signed_char_Array_0_arraysigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L52] COND TRUE (last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_ [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L53] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L53] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L53] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L53] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L53] (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) = (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L57] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L57] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L57] COND FALSE !(((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L60] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer) [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L60] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer)) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L61] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer) [L61] EXPR \read(*signed_char_Array_0_arraysigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] EXPR (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L61] COND FALSE !((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) [L68] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer) [L68] (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer)) [L73] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L73] unsigned char stepLocal_1 = (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)); [L74] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L74] unsigned char stepLocal_0 = (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)); [L75] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L75] COND TRUE (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, stepLocal_1=64, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L76] COND TRUE stepLocal_0 || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) [L77] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L77] COND TRUE stepLocal_1 > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) [L78] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L78] (*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) = (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)) [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR \read(*signed_char_Array_0_arraysigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) [L118] EXPR (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))) [L118] EXPR \read(*signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer) [L118] EXPR (((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 [L118] EXPR \read(*BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer) [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer) [L118] EXPR \read(*unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar0_Pointer) [L118] EXPR \read(*double_Array_0_arraydouble_Array_0arrayVar1_Pointer) [L118] EXPR ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR ((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118] EXPR (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L118-L119] return (((((last_1_unsigned_char_Array_0_0__1_ >> (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) >= last_1_unsigned_char_Array_0_0__1_) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) (((((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) < (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))))))) ? ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))) : (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer)) - (((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) > ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))))) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) == ((unsigned char) ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) < ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) : ((*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer))))) + ((((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) < ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + 1)) : ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))))))))) && ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) ? (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer))) ? ((*(double_Array_0_arraydouble_Array_0arrayVar0_Pointer)) == ((double) (*(double_Array_0_arraydouble_Array_0arrayVar1_Pointer)))) : 1) : 1) : 1)) && ((((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) + (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer))) >= (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)))) : 1)) && (((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer)) || (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer)) >= ((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer)) << (*(signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer)))) ? (((*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer)) > (*(unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer))) ? ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer)))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) 1))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer))))) : ((*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer)) == ((unsigned char) (*(BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer))))) ; [L128] RET, EXPR property() [L128] 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}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var0_Pointer={4:0}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var1_Pointer={4:1}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var2_Pointer={4:2}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var3_Pointer={4:3}, BOOL_unsigned_char_Array_0_arrayBOOL_unsigned_char_Array_0Var4_Pointer={4:4}, double_Array_0={5:0}, double_Array_0_arraydouble_Array_0arrayVar0_Pointer={5:0}, double_Array_0_arraydouble_Array_0arrayVar1_Pointer={5:8}, isInitial=1, last_1_unsigned_char_Array_0_0__1_=64, signed_char_Array_0={6:0}, signed_char_Array_0_arraysigned_char_Array_0Var0_Pointer={6:0}, unsigned_char_Array_0={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var0_Pointer={7:0}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var1_Pointer={7:3}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var2_Pointer={7:1}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var3_Pointer={7:4}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var4_Pointer={7:2}, unsigned_char_Array_0_arrayunsigned_char_Array_0Var5_Pointer={7:5}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 70.2s, OverallIterations: 52, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 27.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14658 SdHoareTripleChecker+Valid, 16.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14646 mSDsluCounter, 51917 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42208 mSDsCounter, 1852 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24370 IncrementalHoareTripleChecker+Invalid, 26222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1852 mSolverCounterUnsat, 9709 mSDtfsCounter, 24370 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1716 GetRequests, 1088 SyntacticMatches, 3 SemanticMatches, 625 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 12.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1966occurred in iteration=51, InterpolantAutomatonStates: 430, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 51 MinimizatonAttempts, 5915 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 35.4s InterpolantComputationTime, 8885 NumberOfCodeBlocks, 8885 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 8666 ConstructedInterpolants, 0 QuantifiedInterpolants, 63324 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2879 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 56 InterpolantComputations, 50 PerfectInterpolantSequences, 37755/38304 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:37:09,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:37:11,061 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:37:11,128 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:37:11,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:37:11,133 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:37:11,181 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:37:11,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:37:11,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:37:11,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:37:11,183 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:37:11,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:37:11,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:37:11,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:37:11,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:37:11,184 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:37:11,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:37:11,185 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:11,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:11,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:11,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:11,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:37:11,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:11,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:37:11,187 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:37:11,188 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:37:11,188 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:37:11,188 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:37:11,188 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:37:11,188 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 10471332ed8d2599b04e210a8f5e1cfca6044f5eaf06c2a8c3075acc10d9721c [2025-01-09 15:37:11,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:37:11,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:37:11,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:37:11,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:37:11,434 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:37:11,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2025-01-09 15:37:12,696 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/391510962/b46197753d52424f98c323abbc101643/FLAGb4a136be7 [2025-01-09 15:37:12,898 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:37:12,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i [2025-01-09 15:37:12,906 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/391510962/b46197753d52424f98c323abbc101643/FLAGb4a136be7 [2025-01-09 15:37:12,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/391510962/b46197753d52424f98c323abbc101643 [2025-01-09 15:37:12,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:37:12,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:37:12,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:12,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:37:12,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:37:12,932 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:12" (1/1) ... [2025-01-09 15:37:12,933 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38220e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:12, skipping insertion in model container [2025-01-09 15:37:12,933 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:37:12" (1/1) ... [2025-01-09 15:37:12,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:37:13,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2025-01-09 15:37:13,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:13,162 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:37:13,170 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-ap_file-56.i[917,930] [2025-01-09 15:37:13,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:37:13,222 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:37:13,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13 WrapperNode [2025-01-09 15:37:13,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:37:13,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:13,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:37:13,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:37:13,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,242 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,266 INFO L138 Inliner]: procedures = 30, calls = 181, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 557 [2025-01-09 15:37:13,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:37:13,267 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:37:13,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:37:13,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:37:13,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,311 INFO L175 MemorySlicer]: Split 147 memory accesses to 5 slices as follows [2, 41, 11, 16, 77]. 52 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 5, 2, 1, 6]. The 18 writes are split as follows [0, 8, 2, 1, 7]. [2025-01-09 15:37:13,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,325 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:37:13,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:37:13,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:37:13,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:37:13,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (1/1) ... [2025-01-09 15:37:13,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:37:13,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:37:13,374 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:37:13,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:37:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:37:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:37:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:37:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:37:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:37:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:37:13,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:37:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:37:13,400 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:37:13,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:37:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:37:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:37:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:37:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:37:13,527 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:37:13,528 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:37:14,035 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2025-01-09 15:37:14,035 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:37:14,045 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:37:14,047 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:37:14,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:14 BoogieIcfgContainer [2025-01-09 15:37:14,047 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:37:14,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:37:14,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:37:14,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:37:14,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:37:12" (1/3) ... [2025-01-09 15:37:14,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f76f875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:14, skipping insertion in model container [2025-01-09 15:37:14,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:37:13" (2/3) ... [2025-01-09 15:37:14,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f76f875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:37:14, skipping insertion in model container [2025-01-09 15:37:14,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:37:14" (3/3) ... [2025-01-09 15:37:14,055 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-ap_file-56.i [2025-01-09 15:37:14,065 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:37:14,067 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-ap_file-56.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:37:14,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:37:14,119 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;@79a5c537, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:37:14,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:37:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:37:14,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:37:14,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:37:14,133 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:37:14,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:37:14,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:37:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2094845632, now seen corresponding path program 1 times [2025-01-09 15:37:14,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:37:14,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000056921] [2025-01-09 15:37:14,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:37:14,146 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 [2025-01-09 15:37:14,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:37:14,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 15:37:14,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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